Author： Komjáth Péter
Publisher： Springer Publishing Company
ISSN： 0179-5376
Source： Discrete & Computational Geometry, Vol.45, Iss.3, 2011-04, pp. : 497-502
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
Circular chromatic number of Kneser graphs
Journal of Combinatorial Theory, Series B, Vol. 88, Iss. 2, 2003-07 ,pp. :
Access to resources
Recommend
Generalized number systems in Euclidean spaces
By Katai I.
Mathematical and Computer Modelling, Vol. 38, Iss. 7, 2003-10 ,pp. :
Upper Bounds of Entire Chromatic Number of Plane Graphs
By Weifan W.
European Journal of Combinatorics, Vol. 20, Iss. 4, 1999-05 ,pp. :
By Chen G. Schelp R.H. Shreve W.E.
European Journal of Combinatorics, Vol. 18, Iss. 1, 1997-01 ,pp. :
Forcing constructions for uncountably chromatic graphs
The Journal of Symbolic Logic, Vol. 53, Iss. 3, 1988-09 ,pp. :