Reverse Mathematics and the Coloring Number of Graphs
-
Published:2016-01-01
Issue:1
Volume:57
Page:
-
ISSN:0029-4527
-
Container-title:Notre Dame Journal of Formal Logic
-
language:
-
Short-container-title:Notre Dame J. Formal Logic
Publisher
Duke University Press
Reference7 articles.
1. [1] Diestel, R., Graph Theory, second edition, Springer, New York, 2000. 2. [2] Erdös, P., and A. Hajnal, “On chromatic number of graphs and set systems,” Acta Mathematica Academicae Sciencia Hungarica, vol. 17 (1966), pp. 61–99. 3. [3] Gasarch, W., and J. L. Hirst, “Reverse mathematics and recursive graph theory,” Mathematical Logic Quarterly, vol. 44 (1998), pp. 465–73. 4. [4] Komjáth, P., and E. C. Milner, “On a conjecture of Rödl and Voigt,” Journal of Combinatorial Theory, Series B, 61 (1994), pp. 199–209. 5. [5] Schmerl, J. H., “Mathematics and graph coloring: Eliminating diagonalization,” pp. 331–348, in Reverse Mathematics 2001, edited by S. G. Simpson, vol. 21, Lecture Notes in Logic, Association of Symbolic Logic, Poughkeepsie, New York, 2005.
|
|