论文信息 - Independent sets in triangle-free cubic planar graphs

Independent sets in triangle-free cubic planar graphs

We prove that every triangle-free planar graph on n vertices with maximum degree three has an independent set with size at least 3/8n. This was suggested and later conjectured by Albertson, Bollobas, and Tucker.

Robin Thomas | Christopher Carl Heckman

[1] E. Scheinerman,et al. Fractional Graph Theory: A Rational Approach to the Theory of Graphs , 1997 .

[2] Xuding Zhu,et al. The circular chromatic number of series-parallel graphs , 2000, J. Graph Theory.

[3] Stephen C. Locke,et al. 11/30 (Finding Large Independent Sets in Connected Triangle-Free 3-Regular Graphs) , 1995, J. Comb. Theory, Ser. B.

[4] W. Staton. Some Ramsey-type numbers and the independence ratio , 1979 .

[5] John S. Allen. An Introductory Course , 1935 .

[6] Daniel H. Ullman,et al. Girth and fractional chromatic number of planar graphs , 2002 .

[7] S. H. Scott,et al. A (<5)-Colour Theorem for Planar Graphs , 1973 .

[8] Robin Thomas,et al. A new proof of the independence ratio of triangle-free cubic graphs , 2001, Discret. Math..

[9] Craig A. Tovey,et al. Planar Ramsey Numbers , 1993, J. Comb. Theory, Ser. B.

[10] W. T. Tutte. A THEOREM ON PLANAR GRAPHS , 1956 .

[11] Xuding Zhu,et al. The circular chromatic number of series-parallel graphs , 2000, Journal of Graph Theory.

[12] Kathryn Fraughnaugh Jones. Independence in graphs with maximum degree four , 1984, J. Comb. Theory, Ser. B.

[13] Kathryn Fraughnaugh Jones. Size and independence in triangle-free graphs with maximum degree three , 1990, J. Graph Theory.