Premium
A Characterization of Graphs with No Octahedron Minor
Author(s) -
Ding Guoli
Publication year - 2013
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.21699
Subject(s) - combinatorics , mathematics , minor (academic) , octahedron , graph , characterization (materials science) , discrete mathematics , chemistry , crystallography , physics , optics , crystal structure , political science , law
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 } ∪ { C 2 n − 1 2 : n ≥ 3 }and five other internally 4‐connected graphs by 0‐, 1‐, 2‐, and 3‐sums.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom