A characterization of some graph classes using excluded minors
- 43 Downloads
In this article we present a structural characterization of graphs without K 5 and the octahedron as a minor. We introduce semiplanar graphs as arbitrary sums of planar graphs, and give their characterization in terms of excluded minors. Some other excluded minor theorems for 3-connected minors are shown.
Key words and phrasesexcluded minors ≤ k-sum of graphs tree-width of a graph
Mathematics subject classification number05C75 05C83
Unable to display preview. Download preview PDF.
- J. Chlebíková, Contributions to Algorithmic Graph Theory: Treewidth, Minors, and Balanced Partitions, Ph.D. thesis, Faculty of Mathematics and Physics, Comenius University, Bratislava, January 2000.Google Scholar
- J. Halin, Über einen graphentheoretischen Basisbegriff und seine Anwendung auf Färbungsprobleme, Dissertation, Köln, 1962.Google Scholar
- R. Thomas, Recent excluded minor theorems for graphs, Surveys in Combinatorics, (eds. J. D. Lamb and D. A. Preece), Cambridge University Press, Cambridge, 1999, pp. 201–222.Google Scholar
- W. T. Tutte, A theory of 3-connected graphs, Indag. Math., 23 (1961), 441–455.Google Scholar