Chromatic classes of certain 2-connected \((n,n+2)\)-graphs. II

DOI10.1016/S0012-365X(96)00265-8zbMath0881.05049MaRDI QIDQ1366773

K. Z. Ouyang, Xiang'en Chen

Publication date: 16 February 1998

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

zbMATH Keywords

chromatic polynomialchromatically equivalentchromatic classes

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

The search for chromatically unique graphs. II ⋮ Chromatic equivalence classes of certain generalized polygon trees

Cites Work

• Unnamed Item
• Unnamed Item
• Chromatic uniqueness of the generalized \(\Theta\)-graph
• Cutpoints and the chromatic polynomial
• An introduction to chromatic polynomials
• A new 5‐arc‐transitive cubic graph

This page was built for publication: Chromatic classes of certain 2-connected \((n,n+2)\)-graphs. II