Search Results

You are looking at 1 - 1 of 1 items for :

  • "tree-width of a graph" x
  • Refine by Access: All Content x
Clear All


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.

Restricted access