A sufficient and necessary condition for the chromatic equivalence of a class of graphs (Q2927156)
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: A sufficient and necessary condition for the chromatic equivalence of a class of graphs |
scientific article; zbMATH DE number 6364132
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A sufficient and necessary condition for the chromatic equivalence of a class of graphs |
scientific article; zbMATH DE number 6364132 |
Statements
3 November 2014
0 references
chromatic polynomial
0 references
adjoint polynomial
0 references
chromatic equivalence
0 references
adjoint equivalence
0 references
A sufficient and necessary condition for the chromatic equivalence of a class of graphs (English)
0 references
