Please use this identifier to cite or link to this item: https://doi.org/10.1016/j.disc.2007.04.063
DC FieldValue
dc.titleA maximal zero-free interval for chromatic polynomials of bipartite planar graphs
dc.contributor.authorDong, F.M.
dc.contributor.authorKoh, K.M.
dc.date.accessioned2014-10-28T02:28:25Z
dc.date.available2014-10-28T02:28:25Z
dc.date.issued2008-06-06
dc.identifier.citationDong, F.M., Koh, K.M. (2008-06-06). A maximal zero-free interval for chromatic polynomials of bipartite planar graphs. Discrete Mathematics 308 (11) : 2285-2287. ScholarBank@NUS Repository. https://doi.org/10.1016/j.disc.2007.04.063
dc.identifier.issn0012365X
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/102676
dc.description.abstractIt is well known that (- ∞, 0) and (0, 1) are two maximal zero-free intervals for all chromatic polynomials. Jackson [A zero-free interval for chromatic polynomials of graphs, Combin. Probab. Comput. 2 (1993), 325-336] discovered that (1, frac(32, 27)] is another maximal zero-free interval for all chromatic polynomials. In this note, we show that (1, frac(32, 27)] is actually a maximal zero-free interval for the chromatic polynomials of bipartite planar graphs. © 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.04.063
dc.sourceScopus
dc.subjectBipartite graph
dc.subjectChromatic polynomial
dc.subjectPlanar graph
dc.subjectZero
dc.subjectZero-free interval
dc.typeArticle
dc.contributor.departmentMATHEMATICS
dc.description.doi10.1016/j.disc.2007.04.063
dc.description.sourcetitleDiscrete Mathematics
dc.description.volume308
dc.description.issue11
dc.description.page2285-2287
dc.description.codenDSMHA
dc.identifier.isiut000254933100025
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.