Author： Alon Noga Berke Robert Buchin Kevin Buchin Maike Csorba Péter Shannigrahi Saswata Speckmann Bettina Zumstein Philipp
Publisher： Springer Publishing Company
ISSN： 0179-5376
Source： Discrete & Computational Geometry, Vol.42, Iss.3, 2009-10, pp. : 421-442
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Related content
On sparse graphs with given colorings and homomorphisms
Journal of Combinatorial Theory, Series B, Vol. 90, Iss. 1, 2004-01 ,pp. :
Access to resources
Recommend
On the Number of 3-Edge Colorings of Cubic Graphs
By Szegedy C.
European Journal of Combinatorics, Vol. 23, Iss. 1, 2002-01 ,pp. :
Visibility Graphs of Point Sets in the Plane
Discrete & Computational Geometry, Vol. 39, Iss. 1-3, 2008-03 ,pp. :
Upper Bounds of Entire Chromatic Number of Plane Graphs
By Weifan W.
European Journal of Combinatorics, Vol. 20, Iss. 4, 1999-05 ,pp. :