Document Type

Article

Publication Date

2-1-2013

Abstract

There are sixteen 3-connected graphs on eleven or fewer edges. For each of these graphs H we discuss the structure of graphs that do not contain a minor isomorphic to H. © 2012 Elsevier B.V. All rights reserved.

Publication Source (Journal or Book title)

Discrete Applied Mathematics

First Page

355

Last Page

368

Share

COinS