Abstract
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 characteriza-
tion in terms of excluded minors. Some other excluded minor theorems
for 3-connected minors are shown.
without K_5 and the octahedron as a minor. We introduce semiplanar
graphs as arbitrary sums of planar graphs, and give their characteriza-
tion in terms of excluded minors. Some other excluded minor theorems
for 3-connected minors are shown.
Original language | English |
---|---|
Pages (from-to) | 1-9 |
Journal | Periodica Mathematica Hungarica |
Volume | 55 |
Issue number | 1 |
DOIs | |
Publication status | Published - 2007 |
Keywords
- excluded minors
- tree-width of a graph
- =<k-sum of graphs