Another family of chromatically unique graphs
From MaRDI portal
Publication:1900525
A graph \(G\) is chromatically unique if any graph that has the same chromatic polynomial as \(G\) is isomorphic to \(G\). There are several classes of graphs that are known to be chromatically unique. In this paper the author presents a construction that provides a new family of chromatically unique graphs.
Recommendations
Cites work
- An introduction to chromatic polynomials
- Chromatic uniqueness of the generalized -graph
- scientific article; zbMATH DE number 3843776 (Why is no real title available?)
- scientific article; zbMATH DE number 3961645 (Why is no real title available?)
- The chromaticity of s-bridge graphs and related graphs
- The search for chromatically unique graphs
Cited in
(10)- Chromatic uniqueness in a family of 2-connected graphs
- The search for chromatically unique graphs. II
- Chromatic equivalence classes of certain generalized polygon trees
- New families of adjointly unique graphs
- A bibliography on chromatic polynomials
- scientific article; zbMATH DE number 5809759 (Why is no real title available?)
- scientific article; zbMATH DE number 3904611 (Why is no real title available?)
- scientific article; zbMATH DE number 4108817 (Why is no real title available?)
- Counterexamples against some families of chromatically unique graphs
- The search for chromatically unique graphs
This page was built for publication: Another family of chromatically unique graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1900525)