No label defined (Q3682504)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3904611
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3904611

      Statements

      1985
      0 references
      chromatic polynomial
      0 references
      chromatically unique graphs
      0 references
      [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.
      0 references

      Identifiers