The search for chromatically unique graphs. II

DOI10.1016/S0012-365X(96)00269-5zbMath0879.05031OpenAlexW1969840824MaRDI QIDQ1366778

Kee L. Teo, Khee Meng Koh

Publication date: 12 January 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00269-5

zbMATH Keywords

surveychromatically unique graphschromatic equivalence

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (25)

Graphs determined by polynomial invariants ⋮ On graphs in which any pair of colour classes but one induces a tree ⋮ On the structure and chromaticity of graphs in which any two colour classes induce a tree ⋮ On chromatic uniqueness of certain 5-partite graphs ⋮ Chromaticity of complete 6-partite graphs with certain star or matching deleted. II ⋮ Chromatic equivalence classes of certain generalized polygon trees. III ⋮ The chromatic uniqueness of certain complete \(t\)-partite graphs. ⋮ Distinguishing graphs by their left and right homomorphism profiles ⋮ Classification of complete 5-partite graphs and chromaticity of 5-partite graphs with \(5n\) vertices ⋮ A new family of chromatically unique 6-bridge graph ⋮ A complete solution to the chromatic equivalence class of graph \(\overline {B_{n-7,1,3}}\) ⋮ On chromatic and flow polynomial unique graphs ⋮ A complete solution to a conjecture on chromatic uniqueness of complete tripartite graphs ⋮ Locally grid graphs: Classification and Tutte uniqueness ⋮ Chromatic uniqueness of atoms in lattices of complete multipartite graphs ⋮ On the minimum real roots of the \(\sigma\)-polynomials and chromatic uniqueness of graphs ⋮ Homomorphisms and polynomial invariants of graphs ⋮ On the chromaticity of complete multipartite graphs with certain edges added ⋮ Some families of chromatically unique bipartite graphs ⋮ Graph homomorphisms, the Tutte polynomial and “q-state Potts uniqueness” ⋮ Structures and chromaticity of some extremal 3-colourable graphs ⋮ Chromatically unique 6-bridge graph theta(a,a,a,b,b,c) ⋮ On matroids determined by their Tutte polynomials ⋮ Contraction-deletion invariants for graphs ⋮ Colorings of the Graph K ᵐ 2 + Kn

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Chromaticity of a family of \(K_ 4\)-homeomorphs
• Classes of chromatically unique graphs
• The search for chromatically unique graphs
• The chromaticity of wheels with a missing spoke
• On trees of polygons
• Chromatic polynomials of generalized trees
• On the chromatic uniqueness of certain bipartite graphs
• The chromatic uniqueness of complete bipartite graphs
• The chromatic uniqueness of certain broken wheels
• Connections between the matching and chromatic polynomials
• The chromaticity of certain graphs with five triangles
• On chromatic uniqueness of uniform subdivisions of graphs
• Chromatic classes of 2-connected \((n,n+3)\)-graphs with at least two triangles
• Classes of chromatically equivalent graphs and polygon trees
• The chromaticity of \(s\)-bridge graphs and related graphs
• On graphs in which any pair of colour classes but one induces a tree
• Chromatic classes of certain 2-connected \((n,n+2)\)-graphs. II
• Adjoint polynomials and chromatically unique graphs
• Chromatic equivalence classes of certain generalized polygon trees
• On the structure and chromaticity of graphs in which any two colour classes induce a tree
• All wheels with two missing consecutive spokes are chromatically unique
• On \(\sigma\)-polynomials and a class of chromatically unique graphs
• Another family of chromatically unique graphs
• On the chromatic uniqueness of the graph \(W(n,n-2)+K_ k\)
• The chromaticity of wheels with a missing spoke. II
• Chromaticity of series-parallel graphs
• On the chromatic uniqueness of the graph \(W(n,n-2,k)\)
• Topology of series-parallel networks
• The chromaticity of complete bipartite graphs with at most one edge deleted
• The number of shortest cycles and the chromatic uniqueness of a graph
• Chromatic polynomials, polygon trees, and outerplanar graphs
• On chromatic uniqueness of two infinite families of graphs
• Maximum chromatic polynomials of 2‐connected graphs
• On the join of graphs and chromatic uniqueness
• On ?-equivalence and ?-equivalence of graphs
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs

This page was built for publication: The search for chromatically unique graphs. II