Please use this identifier to cite or link to this item: http://hdl.handle.net/10497/17686
Title: 
Authors: 
Subjects: 
Chromatic polynomial
Chromatic zero
Issue Date: 
2006
Citation: 
Dong, F., & Koh, K. M. (2006). On graphs having no chromatic zeros in (1, 2). SIAM Journal on Discrete Mathematics, 20(3), 799-810. https://doi.org/10.1137/04061787X
Abstract: 
For a graph G of order n ≥ 2, an ordering (x1, x2, . . . , xn) of the vertices in G is called a double-link ordering of G if x1x2 ∈ E(G) and xi has at least two neighbors in {x1, x2, . . . , xi−1} for all i = 3, 4, . . . , n. This paper shows that certain graphs possessing a kind of double-link ordering have no chromatic zeros in the interval (1, 2). This result implies that all graphs with a 2-tree as a spanning subgraph, certain graphs with a Hamiltonian path, all complete t-partite graphs, where t ≥ 3, and all (v(G) − Δ(G) + 1)-connected graphs G have no chromatic zeros in the interval (1, 2).
URI: 
ISSN: 
0895-4801 (online)
DOI: 
File Permission: 
Open
File Availability: 
With file
Appears in Collections:Journal Articles

Files in This Item:
File Description SizeFormat 
SJDM-20-3-799.pdf156.55 kBAdobe PDFThumbnail
View/Open
Show full item record

SCOPUSTM   
Citations

4
checked on Mar 25, 2023

WEB OF SCIENCETM
Citations

4
checked on Mar 23, 2023

Page view(s)

121
checked on Mar 26, 2023

Download(s) 50

72
checked on Mar 26, 2023

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.