The search for chromatically unique graphs

DOI10.1007/BF01787578zbMath0727.05023OpenAlexW1989719968MaRDI QIDQ803145

Khee Meng Koh, Kee L. Teo

Publication date: 1990

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01787578

zbMATH Keywords

chromatic polynomialchromatically unique graphscomplete bipartite graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (55)

Sunflower hypergraphs are chromatically unique ⋮ Classes of chromatically equivalent graphs and polygon trees ⋮ Graphs determined by polynomial invariants ⋮ Chromatic uniqueness in a family of 2-connected graphs ⋮ Another family of chromatically unique graphs ⋮ Some Results on Chromaticity of Quasilinear Hypergraphs ⋮ On graphs in which any pair of colour classes but one induces a tree ⋮ On the chromatic uniqueness of the graph \(W(n,n-2)+K_ k\) ⋮ A new method for proving chromatic uniqueness of graphs ⋮ New result on chromaticity ofK₄-homeomorphic graphs ⋮ Some problems on chromatic polynomials ⋮ Chromaticity of a family of \(K_ 4\) homeomorphs ⋮ The search for chromatically unique graphs. II ⋮ Chromatic uniqueness of the complements of certain forests ⋮ Adjoint polynomials and chromatically unique graphs ⋮ A bibliography on chromatic polynomials ⋮ The chromaticity of wheels with a missing spoke. II ⋮ On the chromaticity of sunflower hypergraphs \(\text{SH}(n,p,h)\) ⋮ Chromaticity of series-parallel graphs ⋮ On the structure and chromaticity of graphs in which any two colour classes induce a tree ⋮ On the chromatic uniqueness of the graph \(W(n,n-2,k)\) ⋮ 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 ⋮ Divisibility of certain coefficients of the chromatic polynomials. ⋮ The chromatic uniqueness of certain complete \(t\)-partite graphs. ⋮ Distinguishing graphs by their left and right homomorphism profiles ⋮ Chromatic uniqueness of elements of height \(\leq 3\) in lattices of complete multipartite graphs ⋮ 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}}\) ⋮ Chromatic equivalence classes of complete tripartite graphs ⋮ On chromatic and flow polynomial unique graphs ⋮ ON CHROMATIC UNIQUENESS OF SOME COMPLETE TRIPARTITE GRAPHS ⋮ Hypergraphs with pendant paths are not chromatically unique ⋮ Splittings of toric ideals ⋮ A complete solution to a conjecture on chromatic uniqueness of complete tripartite graphs ⋮ Some new results on chromatic uniqueness of \(K_4\)-homeomorphs ⋮ Unnamed Item ⋮ On Garlands in \(\chi\)-uniquely colorable graphs ⋮ About chromatic uniqueness of some complete tripartite graphs ⋮ Chromatic uniqueness of a family of \(K_4\)-homeomorphs ⋮ Chromatic coefficients of linear uniform hypergraphs ⋮ Chromatic uniqueness of atoms in lattices of complete multipartite graphs ⋮ On the minimum real roots of the \(\sigma\)-polynomials and chromatic uniqueness of graphs ⋮ On the chromaticity of complete multipartite graphs with certain edges added ⋮ All wheels with two missing consecutive spokes are chromatically unique ⋮ 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 ⋮ On chromatic uniqueness of uniform subdivisions of graphs

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
• Chromatic polynomials of connected graphs
• The chromaticity of wheels
• Two classes of chromatically unique graphs
• The chromaticity of wheels with a missing spoke
• On the chromatic uniqueness of bipartite graphs
• A note on the chromatic uniqueness of \(W_ 10\)
• On chromatic coefficients
• Chromatic polynomials for regular graphs and modified wheels
• On maximally saturated graphs
• The chromatic uniqueness of certain broken wheels
• Chromatic uniqueness of the generalized \(\Theta\)-graph
• Chromatically unique graphs
• Chromatic classes of 2-connected \((n,n+3)\)-graphs with at least two triangles
• Chromatic uniqueness and equivalence ofK4 homeomorphs
• Cutpoints and the chromatic polynomial
• The chromaticity of complete bipartite graphs with at most one edge deleted
• On 3-colorings of bipartitep-threshold graphs
• Chromatic polynomials and whitney's broken circuits
• Classification of chromatically unique graphs having quadratic σ‐polynomials
• A note on chromatic uniqueness of graphs
• An introduction to chromatic polynomials

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