Domination Numbers of Planar Graphs

Journal of Graph Theory

Volumn 22, Issue 3, 1996, Pages 213-229

  MacGillivray, G ^a   Seyffarth, K ^b  

^a UNIVERSITY OF VICTORIA   (Canada)

^b UNIVERSITY OF CALGARY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 1542475747     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0118(199607)22:3<213::AID-JGT2>3.0.CO;2-P     Document Type: Article

References (8)

1. J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, Elsevier, Amsterdam (1976).
2. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, San Francisco (1979) p. 190.
3. M. Fellows, P. Hell, and K. Seyffarth, Large planar graphs with given diameter and maximum degree, Discrete Applied Math., 61 (1995), 133-154.
4. M. Fellows, P. Hell, and K. Seyffarth, Constructions of dense planar networks, manuscript.
5. P. Hell and K. Seyffarth, Largest planar graphs of diameter two and fixed maximum degree, Discrete Math. 111 (1993), 313-322.
6. W. McCuaig and B. Shepherd, Domination in graphs with minimum degree two, J. Graph Theory 13 (1989), 749-762.
7. O. Ore, Theory of Graphs, American Mathematical Society, Colloquium Publications Vol. 38, American Mathematical Society, Providence, RI (1962).
8. C. Payan, Sur le nombre d'absorption d'un graphe simple. Cahier du C.E.R.O, 17 (1975).