On the chromatic equivalence class of graphs

DOI10.1016/S0012-365X(97)81814-6zbMath0918.05048MaRDI QIDQ1377862

Gek Ling Chia

Publication date: 10 August 1999

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

zbMATH Keywords

chromatic polynomialchromatic equivalence class

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

A bibliography on chromatic polynomials

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On trees of polygons
• On the chromatic equivalence class of a family of graphs
• On graphs in which any pair of colour classes but one induces a tree
• Cutpoints and the chromatic polynomial
• On the chromaticity of certain subgraphs of a q-tree
• The chromaticity of complete bipartite graphs with at most one edge deleted
• Chromaticity of two-trees
• Onq-trees
• A note on chromatic uniqueness of graphs
• An introduction to chromatic polynomials

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