scientific article; zbMATH DE number 3904611

From MaRDI portal
Publication:3682504





[For the entire collection see Zbl 0552.00002.] A simple graph G is chromatically unique if, whenever H has the same chromatic polynomial as G, H is isomorphic to G. This paper surveys the known families of chromatically unique graphs and then describes several new families of such graphs.











This page was built for publication:

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