Name
Abstract | ||
|---|---|---|
It is proved that a graph does not contain an octahedron minor if and only if it is constructed from {K-1, K-2, K-3, K-4} boolean OR {C-2n-1(2) : n >= 3} and five other internally 4-connected graphs by 0-, 1-, 2-, and 3-sums. (C) 2012 Wiley Periodicals, Inc. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1002/jgt.21699 | JOURNAL OF GRAPH THEORY |
Keywords | Field | DocType |
minor,octahedron | Graph,Combinatorics,Octahedral molecular geometry,Octahedron,Octahedral symmetry,Mathematics | Journal |
Volume | Issue | ISSN |
74.0 | 2.0 | 0364-9024 |
Citations | PageRank | References |
4 | 0.52 | 8 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Guoli Ding | 1 | 444 | 51.58 |