|
The maximum size of an independent set in a nonplanar graph
Author(s):
Michael O.
Albertson;
Joan P.
Hutchinson
Journal:
Bull. Amer. Math. Soc.
81
(1975),
Part 1:554-555.
MSC (1970):
Primary 05C10, 55A15;
Secondary 05C15
MathSciNet review:
0364012
Retrieve article in:
PDF
References |
Similar articles |
Additional information
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. MR 369123
- 2.
- M. O. Albertson, A lower bound for the independence number of a planar graph, J. Combinatorial Theory Ser. B (to appear). MR 424599
- 3.
- C. Berge, Graphs and hypergraphs, Dunod, Paris, 1970. MR 898652
- 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. MR 228378
Similar Articles:
Retrieve articles in Bulletin of the American Mathematical Society
with MSC
(1970):
05C10, 55A15, 05C15
Retrieve articles in all Journals with MSC
(1970):
05C10, 55A15, 05C15
Additional Information:
DOI:
10.1090/S0002-9904-1975-13735-9
PII:
S 0002-9904(1975)13735-9
|
