Chromatically unique graphs
From MaRDI portal
Publication:1259606
DOI10.1016/0012-365X(79)90107-9zbMath0411.05035OpenAlexW2018475072MaRDI QIDQ1259606
Chong-Yun Chao, Earl Glen jun. Whitehead
Publication date: 1979
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(79)90107-9
Related Items (24)
On the chromatic uniqueness of bipartite graphs ⋮ On the chromatic equivalence class of a family of graphs ⋮ Chromatic uniqueness in a family of 2-connected graphs ⋮ A bibliography on chromatic polynomials ⋮ The chromaticity of wheels with a missing spoke. II ⋮ On the structure and chromaticity of graphs in which any two colour classes induce a tree ⋮ Chromatic polynomials for regular graphs and modified wheels ⋮ Two classes of chromatically unique graphs ⋮ The chromaticity of wheels with a missing spoke ⋮ On maximally saturated graphs ⋮ Chromatic classes of 2-connected \((n,n+4)\)-graphs with at least four triangles. ⋮ Pairs of chromatically equivalent graphs ⋮ Patterns in Khovanov link and chromatic graph homology ⋮ On the chromatic uniqueness of certain bipartite graphs ⋮ The chromatic uniqueness of certain broken wheels ⋮ The chromatic uniqueness of \(W_{10}\) ⋮ Classes of chromatically unique graphs ⋮ Unnamed Item ⋮ All wheels with two missing consecutive spokes are chromatically unique ⋮ The chromaticity of wheels ⋮ Classes of chromatically unique or equivalent graphs ⋮ The search for chromatically unique graphs ⋮ The chromaticity of certain graphs with five triangles ⋮ Chromatic classes of 2-connected \((n,n+3)\)-graphs with at least two triangles
Cites Work
This page was built for publication: Chromatically unique graphs
