On a tiling conjecture of Komlos for 3-chromatic graphs

Publisher： Elsevier

ISSN： 0012-365X

Source： Discrete Mathematics, Vol.277, Iss.1, 2004-02, pp. : 171-191

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

Related content

On the Universal Tiling Conjecture in Dimension One

By Dutkay Dorin Jorgensen Palle

Journal of Fourier Analysis and Applications, Vol. 19, Iss. 3, 2013-06 ,pp. : 467-477

Springer Publishing Company

Access to resources Recommend Favorite

Circular chromatic number of Kneser graphs

By Hajiabolhassan H. Zhu X.

Journal of Combinatorial Theory, Series B, Vol. 88, Iss. 2, 2003-07 ,pp. : 299-303

Elsevier

Access to resources Recommend Favorite

Forcing constructions for uncountably chromatic graphs

The Journal of Symbolic Logic, Vol. 53, Iss. 3, 1988-09 ,pp. : 696-707

Cambridge University Press

Access to resources Recommend Favorite

Circular Chromatic Numbers and Fractional Chromatic Numbers of Distance Graphs

By Chang G.J. Huang L. Zhu X.

European Journal of Combinatorics, Vol. 19, Iss. 4, 1998-05 ,pp. : 423-431

Elsevier

Access to resources Recommend Favorite

Upper Bounds of Entire Chromatic Number of Plane Graphs

By Weifan W.

European Journal of Combinatorics, Vol. 20, Iss. 4, 1999-05 ,pp. : 313-315

Elsevier

Access to resources Recommend Favorite