Please use this identifier to cite or link to this item: http://hdl.handle.net/10497/17688
Title: 
A zero-free interval for chromatic polynomials of nearly 3-connected plane graphs
Authors: 
Keywords: 
Planar graph
Potts model partition function
Multivariate Tutte polynomial
Chromatic polynomial
Zeros
Issue Date: 
2011
Citation: 
Dong, F., & Jackson, B. (2011). A zero-free interval for chromatic polynomials of nearly 3-connected plane graphs. SIAM Journal on Discrete Mathematics, 25(3), 1103-1118. http://dx.doi.org/10.1137/100790057
Abstract: 
Let G=(V,E) be a nonseparable plane graph on n vertices with at least two edges. Suppose that G has outer face C and that every 2-vertex-cut of G contains at least one vertex of C. Let PG(q) denote the chromatic polynomial of G. We show that (−1)n PG(q)>0 for all 10 for all 1w={we}e∈E, we =−1 for all e which are not incident to a vertex of C, we ∈ W2 for all e∈E(C), we ∈W1 for all other edges e, and W1, W2 are suitably chosen intervals with −1∈W1 ⊂W2 ⊆(−2,0).
-1∈W1⊂W2⊆(-2,0)
.


Read More: http://epubs.siam.org/doi/abs/10.1137/100790057
URI: 
ISSN: 
0895-4801 (online)
Other Identifiers: 
10.1137/100790057
Website: 
Appears in Collections:Journal Articles

Files in This Item:
File Description SizeFormat 
SJDM-25-3-1103.pdf468.67 kBAdobe PDFView/Open
Show full item record

Page view(s) 50

52
checked on Feb 21, 2019

Download(s) 50

36
checked on Feb 21, 2019

Altmetric