Chromatic classes of 2-connected \((n,n+3)\)-graphs with at least two triangles

DOI10.1016/0012-365X(92)00482-7zbMath0796.05033OpenAlexW2109607656MaRDI QIDQ1322232

Kee L. Teo, Khee Meng Koh

Publication date: 5 May 1994

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

Full work available at URL: https://doi.org/10.1016/0012-365x(92)00482-7

zbMATH Keywords

chromatic polynomialschromatically equivalentchromatically unique

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (6)

The search for chromatically unique graphs. II ⋮ A bibliography on chromatic polynomials ⋮ Chromatic classes of 2-connected \((n, n + 4)\)-graphs with exactly three triangles and at least two induced 4-cycles ⋮ Chromatic classes of 2-connected \((n,n+4)\)-graphs with at least four triangles. ⋮ Chromatic classes of 2-connected \((n,n+4)\)-graphs with three triangles and one induced 4-cycle ⋮ The search for chromatically unique graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two classes of chromatically unique graphs
• On chromatic coefficients
• Chromatic uniqueness of the generalized \(\Theta\)-graph
• Chromatically unique graphs
• Chromatic uniqueness and equivalence ofK4 homeomorphs
• Cutpoints and the chromatic polynomial
• An introduction to chromatic polynomials

This page was built for publication: Chromatic classes of 2-connected \((n,n+3)\)-graphs with at least two triangles