On the chromatic equivalence class of a family of graphs

DOI10.1016/0012-365X(95)00320-VzbMath0869.05031OpenAlexW2038914268MaRDI QIDQ1356678

Gek Ling Chia

Publication date: 7 July 1997

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

Full work available at URL: https://doi.org/10.1016/0012-365x(95)00320-v

zbMATH Keywords

pathchromatic polynomialchromatically equivalentchromatic equivalence class

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

A bibliography on chromatic polynomials ⋮ On the chromatic equivalence class of graphs

Cites Work

• The chromatic uniqueness of certain broken wheels
• Chromatically unique graphs
• The chromaticity of certain graphs with five triangles
• An introduction to chromatic polynomials

This page was built for publication: On the chromatic equivalence class of a family of graphs