1. ScholarBank@NUS
  2. 1. Staff
  3. Staff Publications
Please use this identifier to cite or link to this item: https://doi.org/10.1016/j.disc.2007.07.093
DC FieldValue
dc.titleOn planar and non-planar graphs having no chromatic zeros in the interval (1, 2)
dc.contributor.authorDong, F.M.
dc.contributor.authorKoh, K.M.
dc.date.accessioned2014-10-28T02:40:56Z
dc.date.available2014-10-28T02:40:56Z
dc.date.issued2008-09-06
dc.identifier.citationDong, F.M., Koh, K.M. (2008-09-06). On planar and non-planar graphs having no chromatic zeros in the interval (1, 2). Discrete Mathematics 308 (17) : 3897-3905. ScholarBank@NUS Repository. https://doi.org/10.1016/j.disc.2007.07.093
dc.identifier.issn0012365X
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/103742
dc.description.abstractWe exhibit a family of 2-connected graphs which is closed under certain operations, and show that each graph in the family has no chromatic zeros in the interval (1,2). The family contains not only collections of graphs having no certain minors, but also collections of plane graphs, including near-triangulations found by Birkhoff and Lewis [Chromatic polynomials, Trans. Amer. Math. Soc. 60 (1946) 355-451]. © 2007 Elsevier B.V. All rights reserved.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1016/j.disc.2007.07.093
dc.sourceScopus
dc.subjectChromatic polynomial
dc.subjectChromatic zero
dc.subjectMinor
dc.subjectNear-triangulation
dc.subjectPlane graph
dc.typeArticle
dc.contributor.departmentMATHEMATICS
dc.description.doi10.1016/j.disc.2007.07.093
dc.description.sourcetitleDiscrete Mathematics
dc.description.volume308
dc.description.issue17
dc.description.page3897-3905
dc.description.codenDSMHA
dc.identifier.isiut000257303500015
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


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