The Independence Ratio and Genus of a Graph
Open Access
- 1 February 1977
- journal article
- Published by JSTOR in Transactions of the American Mathematical Society
- Vol. 226, 161-173
- https://doi.org/10.2307/1997946
Abstract
In this paper we study the relationship between the genus of a graph and the ratio of the independence number to the number of vertices.Keywords
This publication has 6 references indexed in Scilit:
- A lower bound for the independence number of a planar graphJournal of Combinatorial Theory, Series B, 1976
- Inégalités nouvelles dans le problème des quatre couleursJournal of Combinatorial Theory, Series B, 1975
- The maximum size of an independent set in a nonplanar graphBulletin of the American Mathematical Society, 1975
- Finding an independent set in a planar graphPublished by Springer Nature ,1974
- SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEMProceedings of the National Academy of Sciences, 1968
- Short Proof of a Map-Colour TheoremCanadian Journal of Mathematics, 1957