Planar Triangulations with Real Chromatic Roots Arbitrarily Close to 4

ISSN： 0218-0006

Source： Annals of Combinatorics, Vol.12, Iss.2, 2008-07, pp. : 195-210

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A PTAS for the sparsest 2-spanner of 4-connected planar triangulations

By Duckworth W. Wormald N.C. Zito M.

Journal of Discrete Algorithms, Vol. 1, Iss. 1, 2003-02 ,pp. : 67-76

Elsevier

Access to resources Recommend Favorite

Improved upper bound for acyclic chromatic index of planar graphs without 4-cycles

By Wang Yingqian Sheng Ping

Journal of Combinatorial Optimization, Vol. 27, Iss. 3, 2014-04 ,pp. : 519-529

Springer Publishing Company

Access to resources Recommend Favorite

Star list chromatic number of planar subcubic graphs

By Chen Min Raspaud André Wang Weifan

Journal of Combinatorial Optimization, Vol. 27, Iss. 3, 2014-04 ,pp. : 440-450

Springer Publishing Company

Access to resources Recommend Favorite

Trees and jumps and real roots

By Krandick W.

Journal of Computational and Applied Mathematics, Vol. 162, Iss. 1, 2004-01 ,pp. : 51-55

Elsevier

Access to resources Recommend Favorite

Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations

By Goodrich M.T. Tamassia R.

Journal of Algorithms, Vol. 23, Iss. 1, 1997-04 ,pp. : 51-73

Academic Press

Access to resources Recommend Favorite