On planar and non-planar graphs having no chromatic zeros in the interval(1,2) (Q932643)
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 5300646
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On planar and non-planar graphs having no chromatic zeros in the interval(1,2) |
scientific article; zbMATH DE number 5300646 |
Statements
On planar and non-planar graphs having no chromatic zeros in the interval(1,2) (English)
0 references
11 July 2008
0 references
A chromatic zero of a graph \(G\) is a zero of the chromatic polynomial of \(G\). A near-triangulation is a loopless connected plane graph having at most one non-triangular face. The authors describe a family of 2-connected graphs closed under certain operations and having no chromatic zeros in \((1,2)\). The family contains collections of graphs avoiding certain minors and also collections of plane graphs, including near-triangulation found by \textit{G. Birkhoff} and \textit{D. G. Lewis} [Trans. Am. Math. Soc. 60, 355--451 (1946; Zbl 0060.41601)].
0 references
near-triangulation
0 references
plane graph
0 references
chromatic polynomial
0 references
chromatic zero
0 references
minor
0 references
0.8454197645187378
0 references
0.8439603447914124
0 references
0.8317712545394897
0 references
0.8254246115684509
0 references
0.822388231754303
0 references
