Non-bipartite chromatic factors

DOI10.1016/j.disc.2011.12.002zbMath1270.05081OpenAlexW1979786782MaRDI QIDQ409454

Kerri Morgan, Graham E. Farr

Publication date: 13 April 2012

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

Full work available at URL: https://doi.org/10.1016/j.disc.2011.12.002

zbMATH Keywords

chromatic polynomialchromatic factorisationchromatic factors

Mathematics Subject Classification ID

Graph polynomials (05C31) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items

Certificates for properties of stability polynomials of graphs ⋮ Short certificates for chromatic equivalence ⋮ Pairs of chromatically equivalent graphs ⋮ Galois groups of chromatic polynomials ⋮ An infinite family of 2-connected graphs that have reliability factorisations

Cites Work

• On chromatic coefficients
• Certificates of factorisation for chromatic polynomials
• Certificates of factorisation for a class of triangle-free graphs