Pairs of chromatically equivalent graphs

DOI10.1007/S00373-010-0984-ZzbMath1235.05053OpenAlexW1982992685MaRDI QIDQ659723

Kerri Morgan

Publication date: 24 January 2012

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-010-0984-z

zbMATH Keywords

Chromatic equivalenceChromatic polynomial

Mathematics Subject Classification ID

Graph polynomials (05C31) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Certificates for properties of stability polynomials of graphs ⋮ Short certificates for chromatic equivalence ⋮ Galois groups of chromatic polynomials

Cites Work

• Non-bipartite chromatic factors
• The chromaticity of wheels
• Chromatically unique graphs
• Certificates of factorisation for chromatic polynomials
• Certificates of factorisation for a class of triangle-free graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Pairs of chromatically equivalent graphs