The maximum size of an independent set in a nonplanar graph
HTML articles powered by AMS MathViewer
- by Michael O. Albertson and Joan P. Hutchinson PDF
- Bull. Amer. Math. Soc. 81 (1975), 554-555
References
- Michael O. Albertson, Finding an independent set in a planar graph, Graphs and combinatorics (Proc. Capital Conf., George Washington Univ., Washington, D.C., 1973) Lecture Notes in Math., Vol. 406, Springer, Berlin, 1974, pp. 173–179. MR 0369123
- Michael O. Albertson, A lower bound for the independence number of a planar graph, J. Combinatorial Theory Ser. B 20 (1976), no. 1, 84–93. MR 424599, DOI 10.1016/0095-8956(76)90071-x
- Claude Berge, Hypergraphes, $\mu _{B}$, Dunod, Paris, 1987 (French). Combinatoire des ensembles finis. [Combinatorics of finite sets]. MR 898652
- Gerhard 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 228378, DOI 10.1073/pnas.60.2.438
Additional Information
- Journal: Bull. Amer. Math. Soc. 81 (1975), 554-555
- MSC (1970): Primary 05C10, 55A15; Secondary 05C15
- DOI: https://doi.org/10.1090/S0002-9904-1975-13735-9
- MathSciNet review: 0364012