Chromatic uniqueness of two kinds of 2-connected \((n,n+4)\)-graphs (Q5192052)
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 5589776
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Chromatic uniqueness of two kinds of 2-connected \((n,n+4)\)-graphs |
scientific article; zbMATH DE number 5589776 |
Statements
3 August 2009
0 references
2-connected graphs
0 references
chromatic polynomial
0 references
chromatic uniqueness
0 references
0.8860803842544556
0 references
0.860230565071106
0 references
0.8592742681503296
0 references
0.8357952237129211
0 references
