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.











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)