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 the normal view instead:
scientific article; zbMATH DE number 6364132
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8697049021720886
0 references
0.8320706486701965
0 references
0.817002534866333
0 references
0.8118269443511963
0 references
0.8074525594711304
0 references
