Non-bipartite chromatic factors

DOI10.1016/J.DISC.2011.12.002MaRDI QIDQ409454zbMATHOpenAlexFDO

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

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)

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

Cites work

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

Cited in

(7)

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

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)