A lower bound for the independence number of a planar graph, Journal of Combinatorial Theory, Series B, vol.20, issue.1, pp.84-93, 1976. ,
DOI : 10.1016/0095-8956(76)90071-X
The independence ratio and maximum degree of a graph, Proceedings of the Seventh Southeastern Conference on Combinatorics, Graph Theory, and Computing, pp.43-50, 1976. ,
Every planar map is four colorable. I. Discharging, Illinois J. Math, vol.21, issue.3, pp.429-490, 1977. ,
Every planar map is four colorable, II. Reducibility, Illinois J. Math, vol.21, issue.3, pp.491-567, 1977. ,
On the size of independent sets in graphs, Congr. Numer, vol.21, pp.269-274, 1978. ,
The fractional chromatic number of triangle-free subcubic graphs, European Journal of Combinatorics, vol.35, pp.184-220, 2014. ,
DOI : 10.1016/j.ejc.2013.06.006
Zur Theorie der diskreten Gebilde. VII. Ein Dreifarbensatz für dreikreisfreie Netze auf der Kugel, Wiss. Z. Martin-Luther-Univ. Halle- Wittenberg. Math.-Nat. Reihe, vol.8, pp.109-120, 1958. ,
The Fractional Chromatic Number of Graphs of Maximum Degree at Most Three, SIAM Journal on Discrete Mathematics, vol.23, issue.4, pp.1162-1175, 2009. ,
DOI : 10.1137/080712635
A new proof of the independence ratio of triangle-free cubic graphs, Discrete Math, pp.233-237, 2001. ,
Independent sets in triangle-free cubic planar graphs, J. Combin. Theory Ser. B, vol.96, issue.2, pp.253-275, 2006. ,
A (<5)-Colour Theorem for Planar Graphs, Bulletin of the London Mathematical Society, vol.5, issue.3, pp.302-306, 1973. ,
DOI : 10.1112/blms/5.3.302
Independence in graphs with maximum degree four, Journal of Combinatorial Theory, Series B, vol.37, issue.3, pp.254-269, 1984. ,
DOI : 10.1016/0095-8956(84)90058-3
The fractional chromatic number of mycielski's graphs, Journal of Graph Theory, vol.2, issue.3, pp.411-416, 1995. ,
DOI : 10.1002/jgt.3190190313
An Upper Bound on the Fractional Chromatic Number of Triangle-Free Subcubic Graphs, SIAM Journal on Discrete Mathematics, vol.28, issue.3, pp.1102-1136, 2014. ,
DOI : 10.1137/120900678
The fractional chromatic number of triangle-free graphs with ? 3, Discrete Math, pp.312-3502, 2012. ,
The Four-Colour Theorem, Journal of Combinatorial Theory, Series B, vol.70, issue.1, pp.2-44, 1997. ,
DOI : 10.1006/jctb.1997.1750
Fractional graph theory, Wiley- Interscience Series in Discrete Mathematics and Optimization, 1997. ,
Some Ramsey-type numbers and the independence ratio, Transactions of the American Mathematical Society, vol.256, pp.353-370, 1979. ,
DOI : 10.1090/S0002-9947-1979-0546922-6
Planar Ramsey Numbers, Journal of Combinatorial Theory, Series B, vol.59, issue.2, pp.288-296, 1993. ,
DOI : 10.1006/jctb.1993.1070
Every 2-choosable graph is (2m, m)-choosable, J. Graph Theory, vol.22, issue.3, pp.245-252, 1996. ,
Bipartite subgraphs of triangle-free subcubic graphs, Journal of Combinatorial Theory, Series B, vol.99, issue.1, pp.62-83, 2009. ,
DOI : 10.1016/j.jctb.2008.04.005