Pairs of chromatically equivalent graphs
From MaRDI portal
Recommendations
Cites work
- Certificates of factorisation for a class of triangle-free graphs
- Certificates of factorisation for chromatic polynomials
- Chromatically unique graphs
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 4091530 (Why is no real title available?)
- scientific article; zbMATH DE number 4108817 (Why is no real title available?)
- scientific article; zbMATH DE number 3758362 (Why is no real title available?)
- scientific article; zbMATH DE number 3465327 (Why is no real title available?)
- scientific article; zbMATH DE number 2199828 (Why is no real title available?)
- Non-bipartite chromatic factors
- The chromaticity of wheels
Cited in
(7)- scientific article; zbMATH DE number 5073889 (Why is no real title available?)
- Certificates for properties of stability polynomials of graphs
- scientific article; zbMATH DE number 812060 (Why is no real title available?)
- Tutte polynomials and a stronger version of the Akiyama-Harary problem
- Galois groups of chromatic polynomials
- Short certificates for chromatic equivalence
- Graph polynomials: some questions on the edge
This page was built for publication: Pairs of chromatically equivalent graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659723)