Short certificates for chromatic equivalence

DOI10.7155/JGAA.00490MaRDI QIDQ5377353zbMATH OpenOpenAlexFDO

Authors Zoe Bukovac, Kerri Morgan, Graham Farr

Publication date 24 May 2019

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.7155/jgaa.00490

zbMATH Keywords

certificates of equivalencechromatic polynomial

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph polynomials (05C31) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Certificates of factorisation for chromatic polynomials
• Pairs of chromatically equivalent graphs
• Chromaticity of some families of dense graphs
• Chromatic equivalence classes of certain generalized polygon trees. III
• Non-bipartite chromatic factors

Cites work

• A bibliography on chromatic polynomials
• Certificates for properties of stability polynomials of graphs
• Certificates of factorisation for a class of triangle-free graphs
• Certificates of factorisation for chromatic polynomials
• Contraction-deletion invariants for graphs
• Divisibility of certain coefficients of the chromatic polynomials.
• Graph theory
• Hard Enumeration Problems in Geometry and Combinatorics
• scientific article; zbMATH DE number 3823850 (Why is no real title available?)
• scientific article; zbMATH DE number 2199828 (Why is no real title available?)
• Non-bipartite chromatic factors
• On chromatic equivalence of graphs
• On the computational complexity of the Jones and Tutte polynomials
• Pairs of chromatically equivalent graphs
• Practical graph isomorphism. II.
• Reducibility among combinatorial problems
• The coloring of graphs
• The Complexity of Counting Colourings of Subgraphs of the Grid

Cited in

(4)

• Certificates of factorisation for chromatic polynomials
• Certificates of factorisation for a class of triangle-free graphs
• Certificates for properties of stability polynomials of graphs
• Graph polynomials: some questions on the edge

Describes a project that uses

Uses Software

• Traces
• nauty

This page was built for publication: Short certificates for chromatic equivalence

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