论文信息 - On the independence ratio of a graph

On the independence ratio of a graph

This paper presents some recent results on lower bounds for independence ratios of graphs of positive genus and shows that in a limiting sense these graphs have the same independence ratios as do planar graphs. This last result is obtained by an application of Menger's Theorem to show that every triangulation of a surface of positive genus has a short cycle which does not separate the graph and is non-contractible on that surface.

Michael O. Albertson | Joan P. Hutchinson | J. Hutchinson | M. Albertson | J. P. Hutchinson

[1] Michael O. Albertson,et al. The maximum size of an independent set in a nonplanar graph , 1975 .

[2] Michael O. Albertson,et al. The independence ratio and genus of a graph , 1977 .

[3] Michael O. Albertson,et al. A lower bound for the independence number of a planar graph , 1976 .

[4] C. L. Liu,et al. Introduction to Combinatorial Mathematics. , 1971 .

[5] G. Ringel,et al. Solution of the heawood map-coloring problem. , 1968, Proceedings of the National Academy of Sciences of the United States of America.

[6] K. Menger. Zur allgemeinen Kurventheorie , 1927 .

[7] R. L. Brooks. On Colouring the Nodes of a Network , 1941 .