Short certificates for chromatic equivalence
From MaRDI portal
Publication:5377353
DOI10.7155/jgaa.00490zbMath1411.05082OpenAlexW2937380089MaRDI QIDQ5377353
Zoe Bukovac, Kerri Morgan, Graham E. Farr
Publication date: 24 May 2019
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7155/jgaa.00490
Graph polynomials (05C31) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Certificates for properties of stability polynomials of graphs
- Non-bipartite chromatic factors
- Pairs of chromatically equivalent graphs
- The coloring of graphs
- A bibliography on chromatic polynomials
- Divisibility of certain coefficients of the chromatic polynomials.
- Contraction-deletion invariants for graphs
- Certificates of factorisation for chromatic polynomials
- Certificates of factorisation for a class of triangle-free graphs
- Practical graph isomorphism. II.
- Hard Enumeration Problems in Geometry and Combinatorics
- On chromatic equivalence of graphs
- On the computational complexity of the Jones and Tutte polynomials
- Reducibility among Combinatorial Problems
- The Complexity of Counting Colourings of Subgraphs of the Grid
This page was built for publication: Short certificates for chromatic equivalence