Pairs of chromatically equivalent graphs

DOI10.1007/S00373-010-0984-ZzbMATH Open1235.05053OpenAlexW1982992685MaRDI QIDQ659723FDOQ659723

Authors: 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

Recommendations

• scientific article
• Chromatic classes of 2-connected \((n,n+3)\)-graphs with at least two triangles
• Chromaticity of some families of dense graphs
• Chromatic equivalence classes of certain generalized polygon trees. III
• On the chromatic equivalence class of graphs

zbMATH Keywords

Chromatic equivalenceChromatic polynomial

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Certificates of factorisation for chromatic polynomials
• Certificates of factorisation for a class of triangle-free graphs
• Non-bipartite chromatic factors
• Title not available (Why is that?)
• Chromatically unique graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The chromaticity of wheels

Cited In (6)

• Short certificates for chromatic equivalence
• Certificates for properties of stability polynomials of graphs
• Galois groups of chromatic polynomials
• Title not available (Why is that?)
• Tutte polynomials and a stronger version of the Akiyama-Harary problem
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659723)