Title
A characterization of graphs with no octahedron minor
Document Type
Article
Publication Date
1-1-2013
Abstract
It is proved that a graph does not contain an octahedron minor if and only if it is constructed from {K1,K2,K3,K4}â̂{C2n-12:n≥3} and five other internally 4-connected graphs by 0-, 1-, 2-, and 3-sums. © 2012 Wiley Periodicals, Inc.
Publication Source (Journal or Book title)
Journal of Graph Theory
First Page
143
Last Page
162
Recommended Citation
Ding, G. (2013). A characterization of graphs with no octahedron minor. Journal of Graph Theory, 74 (2), 143-162. https://doi.org/10.1002/jgt.21699
COinS