The maximum size of an independent set in a nonplanar graph
Michael O. Albertson and Joan P. Hutchinson
Source: Bull. Amer. Math. Soc. Volume 81, Number 3, Part 1 (1975), 554-555.
Full-text: Open access
Links and Identifiers
Permanent link to this document: http://projecteuclid.org/euclid.bams/1183536868
Mathematical Reviews number (MathSciNet):
MR0364012
Zentralblatt MATH identifier:
0311.05107
References
1. M. O. Albertson, Finding an independent set in a planar graph, Graphs and Combinatorics (R. Bari and F. Harary, editors), Springer-Verlag, New York, 1974.
Zentralblatt MATH:
0294.05103
Mathematical Reviews (MathSciNet):
MR369123
2. M. O. Albertson, A lower bound for the independence number of a planar graph, J. Combinatorial Theory Ser. B (to appear).
Zentralblatt MATH:
0286.05105
Mathematical Reviews (MathSciNet):
MR424599
3. C. Berge, Graphs and hypergraphs, Dunod, Paris, 1970.
Zentralblatt MATH:
0623.05001
Mathematical Reviews (MathSciNet):
MR898652
4. G. Ringel and J. W. T. Youngs, Solution of the Heawood map-coloring problem, Proc. Nat. Acad. Sci. U. S. A. 60 (1968), 438-445. MR 37 #3959.
Zentralblatt MATH:
0155.51201
Mathematical Reviews (MathSciNet):
MR228378
