A complete solution to the chromatic equivalence class of graph \(\overline{\zeta^1_n}\) (Q2906259)
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 complete solution to the chromatic equivalence class of graph ^1_n |
scientific article; zbMATH DE number 6077301
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A complete solution to the chromatic equivalence class of graph \(\overline{\zeta^1_n}\) |
scientific article; zbMATH DE number 6077301 |
Statements
5 September 2012
0 references
chromatic equivalence class
0 references
adjoint polynomial
0 references
the smallest real root
0 references
the fifth character
0 references
A complete solution to the chromatic equivalence class of graph \(\overline{\zeta^1_n}\) (English)
0 references
0.934769332408905
0 references
0.92495995759964
0 references
0.9140599370002748
0 references
0.9012091159820556
0 references
0.8833363652229309
0 references
