A note on the chromaticity of some 2-connected \((n,n+3)\)-graphs

DOI10.1016/S0012-365X(01)00217-5zbMath0994.05065OpenAlexW2074383285MaRDI QIDQ5957711

Fengming Dong, Kee L. Teo, Khee Meng Koh

Publication date: 13 March 2002

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

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

zbMATH Keywords

chromatic polynomialchromatic equivalence classeschromatic uniquenesschromatically closed set

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (3)

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

This page was built for publication: A note on the chromaticity of some 2-connected \((n,n+3)\)-graphs