%0 Journal Article %1 dong08 %A Dong, F. M. %A Koh, K. M. %D 2008 %J Discrete Mathematics %K algebraic.graph.theory bipartite chromatic planar polynomial root root-free %N 11 %P 2285--2287 %R 10.1016/j.disc.2007.04.063 %T A Maximal Zero-Free Interval for Chromatic Polynomials of Bipartite Planar Graphs %V 308 %X It 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 , 32 27 is another maximal zero-free interval for all chromatic polynomials. In this note, we show that ( 1 , 32 27 is actually a maximal zero-free interval for the chromatic polynomials of bipartite planar graphs.

@article{dong08, abstract = {It 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 , 32 27 ] is another maximal zero-free interval for all chromatic polynomials. In this note, we show that ( 1 , 32 27 ] is actually a maximal zero-free interval for the chromatic polynomials of bipartite planar graphs. }, added-at = {2016-01-30T12:29:11.000+0100}, author = {Dong, F. M. and Koh, K. M.}, biburl = {https://www.bibsonomy.org/bibtex/234b93344cea9d682f64c1e5229b8a143/ytyoun}, doi = {10.1016/j.disc.2007.04.063}, interhash = {09b256061636f3d9ebb284b92fb68f26}, intrahash = {34b93344cea9d682f64c1e5229b8a143}, issn = {0012-365X}, journal = {Discrete Mathematics }, keywords = {algebraic.graph.theory bipartite chromatic planar polynomial root root-free}, number = 11, pages = {2285--2287}, timestamp = {2016-02-25T13:30:47.000+0100}, title = {A Maximal Zero-Free Interval for Chromatic Polynomials of Bipartite Planar Graphs }, volume = 308, year = 2008 }