Chromatic classes of 2-connected \((n,n+4)\)-graphs with at least four triangles. (Q1427480)
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: Chromatic classes of 2-connected \((n,n+4)\)-graphs with at least four triangles. |
scientific article; zbMATH DE number 2055742
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Chromatic classes of 2-connected \((n,n+4)\)-graphs with at least four triangles. |
scientific article; zbMATH DE number 2055742 |
Statements
Chromatic classes of 2-connected \((n,n+4)\)-graphs with at least four triangles. (English)
0 references
14 March 2004
0 references
Chromatic polynomial
0 references
Chromatically equivalent
0 references
Chromatically unique
0 references
0.9685627
0 references
0.9681294
0 references
0.9488604
0 references
0.9231547
0 references
0.92282677
0 references
0.9128394
0 references
0 references
0.87637043
0 references
