On planar and non-planar graphs having no chromatic zeros in the interval(1,2) (Q932643): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Fengming Dong / rank | |||
Property / author | |||
Property / author: Khee Meng Koh / rank | |||
Property / author | |||
Property / author: Fengming Dong / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Khee Meng Koh / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.disc.2007.07.093 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1974335154 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Chromatic Polynomials / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4947393 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Graphs Having No Chromatic Zeros in (1,2) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5313291 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Zero-Free Interval for Chromatic Polynomials of Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3819084 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Chromatic polynomials, polygon trees, and outerplanar graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4128619 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 13:23, 28 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On planar and non-planar graphs having no chromatic zeros in the interval(1,2) |
scientific article |
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