Chromatic uniqueness of the generalized \(\Theta\)-graph
From MaRDI portal
Publication:1250829
DOI10.1016/0012-365X(78)90012-2zbMath0389.05034MaRDI QIDQ1250829
Publication date: 1978
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (23)
The chromaticity of \(s\)-bridge graphs and related graphs ⋮ Another family of chromatically unique graphs ⋮ Chromatic classes of certain 2-connected \((n,n+2)\)-graphs. II ⋮ On T-chromatic uniqueness of graphs ⋮ A bibliography on chromatic polynomials ⋮ Chromaticity of series-parallel graphs ⋮ Chromatic uniqueness and equivalence ofK4 homeomorphs ⋮ The chromaticity of complete bipartite graphs with at most one edge deleted ⋮ Chromatic classes of 2-connected \((n, n + 4)\)-graphs with exactly three triangles and at least two induced 4-cycles ⋮ Chromatic polynomials for regular graphs and modified wheels ⋮ Theta graphs, graph decompositions and related graph labelling techniques ⋮ Two classes of chromatically unique graphs ⋮ Chromatic classes of 2-connected \((n,n+4)\)-graphs with at least four triangles. ⋮ A new family of chromatically unique 6-bridge graph ⋮ Unnamed Item ⋮ Chromatically unique graphs ⋮ Chromatic classes of 2-connected \((n,n+4)\)-graphs with three triangles and one induced 4-cycle ⋮ On chromatic uniqueness of two infinite families of graphs ⋮ Theta graphs, graph decompositions and related graph labelling techniques ⋮ On the chromaticity of complete multipartite graphs with certain edges added ⋮ Chromatically unique 6-bridge graph theta(a,a,a,b,b,c) ⋮ The search for chromatically unique graphs ⋮ Chromatic classes of 2-connected \((n,n+3)\)-graphs with at least two triangles
Cites Work
This page was built for publication: Chromatic uniqueness of the generalized \(\Theta\)-graph
