Another family of chromatically unique graphs (Q1900525)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Another family of chromatically unique graphs |
scientific article; zbMATH DE number 811350
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Another family of chromatically unique graphs |
scientific article; zbMATH DE number 811350 |
Statements
Another family of chromatically unique graphs (English)
0 references
29 November 1995
0 references
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.
0 references
chromatic polynomial
0 references
chromatically unique graphs
0 references
0.8665985465049744
0 references
0.8564119935035706
0 references
0.8494806289672852
0 references
