| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 419771 | Discrete Applied Mathematics | 2013 | 14 Pages |
Abstract
There are sixteen 3-connected graphs on eleven or fewer edges. For each of these graphs HH we discuss the structure of graphs that do not contain a minor isomorphic to HH.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Guoli Ding, Cheng Liu,