Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz

Author： Fox Jacob Lee Choongbum Sudakov Benny

ISSN： 0209-9683

Source： Combinatorica, Vol.33, Iss.2, 2013-04, pp. : 181-197

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

The Sigma Chromatic Number of a Graph

By Chartrand Gary

Graphs and Combinatorics, Vol. 26, Iss. 6, 2010-11 ,pp. : 755-773

Springer Publishing Company

Access to resources Recommend Favorite

Playing a Game to Bound the Chromatic Number

By Panagopoulou Panagiota N. Spirakis Paul G.

American Mathematical Monthly, Vol. 119, Iss. 9, 2012-11 ,pp. : 771-778

Mathematical Association of America

Access to resources Recommend Favorite

On the Chromatic Number of Subsets of the Euclidean Plane

By Axenovich M. Choi J. Lastrina M. McKay T. Smith J. Stanton B.

Graphs and Combinatorics, Vol. 30, Iss. 1, 2014-01 ,pp. : 71-81

Springer Publishing Company

Access to resources Recommend Favorite

Circular Chromatic Number and Mycielski Graphs

By Fan Genghua

Combinatorica, Vol. 24, Iss. 1, 2004-01 ,pp. : 127-135

Springer Publishing Company

Access to resources Recommend Favorite

The list-chromatic number of infinite graphs

By Komjáth Péter

Israel Journal of Mathematics, Vol. 196, Iss. 1, 2013-08 ,pp. : 67-94

Springer Publishing Company

Access to resources Recommend Favorite