scientific article

zbMath0532.05027MaRDI QIDQ3313882

Chong-Yun Chao, Lian-Chang Zhao

Publication date: 1983

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

chromatic polynomialssubdivisions of \(K_4\)

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Related Items (17)

Classes of chromatically equivalent graphs and polygon trees ⋮ 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 homeomorphic to \(K_ 4\) ⋮ Chromatic classes of certain 2-connected \((n,n+2)\)-graphs. II ⋮ Chromaticity of a family of \(K_ 4\) homeomorphs ⋮ A bibliography on chromatic polynomials ⋮ Chromatic uniqueness and equivalence ofK4 homeomorphs ⋮ Chromatic equivalence classes of certain generalized polygon trees. III ⋮ Two classes of chromatically unique graphs ⋮ A note on chain lengths and the Tutte polynomial ⋮ Chromaticity of a family of \(K_ 4\)-homeomorphs ⋮ Some new results on chromatic uniqueness of \(K_4\)-homeomorphs ⋮ Chromatic uniqueness of a family of \(K_4\)-homeomorphs ⋮ Chromatic polynomials of connected graphs ⋮ The search for chromatically unique graphs ⋮ Chromatic classes of 2-connected \((n,n+3)\)-graphs with at least two triangles

This page was built for publication: