Non-bipartite chromatic factors

DOI10.1016/J.DISC.2011.12.002zbMATH Open1270.05081OpenAlexW1979786782MaRDI QIDQ409454FDOQ409454

Authors: Kerri Morgan, Graham 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

Recommendations

• Certificates of factorisation for a class of triangle-free graphs
• Certificates of factorisation for chromatic polynomials
• Chromatic factorizations of a graph
• Publication:4489800
• The factorization theorem of adjoint polynomials of graphs with application

zbMATH Keywords

chromatic polynomialchromatic factorisationchromatic factors

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (7)

• Short certificates for chromatic equivalence
• Certificates for properties of stability polynomials of graphs
• Pairs of chromatically equivalent graphs
• An infinite family of 2-connected graphs that have reliability factorisations
• Galois groups of chromatic polynomials
• Certificates of factorisation for chromatic polynomials
• Certificates of factorisation for a class of triangle-free graphs

This page was built for publication: Non-bipartite chromatic factors

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