Independent sets in triangle-free cubic planar graphs
Authors:
- 1 March 2006
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 96 (2) , 253-275
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Girth and fractional chromatic number of planar graphsJournal of Graph Theory, 2002
- A new proof of the independence ratio of triangle-free cubic graphsDiscrete Mathematics, 2001
- 11/30 (Finding Large Independent Sets in Connected Triangle-Free 3-Regular Graphs)Journal of Combinatorial Theory, Series B, 1995
- Planar Ramsey NumbersJournal of Combinatorial Theory, Series B, 1993
- Size and independence in triangle-free graphs with maximum degree threeJournal of Graph Theory, 1990
- Independence in graphs with maximum degree fourJournal of Combinatorial Theory, Series B, 1984
- Graph Theory1979
- Some Ramsey-type numbers and the independence ratioTransactions of the American Mathematical Society, 1979
- A (<5)-Colour Theorem for Planar GraphsBulletin of the London Mathematical Society, 1973
- A theorem on planar graphsTransactions of the American Mathematical Society, 1956