Results 171 to 180 of about 193 (188)
Some of the next articles are maybe not open access.
A characterization of graphs with no octahedron minor
J. Graph Theory, 2013Summary: 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\} \cup \{C_{2n-1}^2 : n\geq 3\}\) and five other internally 4-connected graphs by 0-, 1-, 2-, and 3-sums.
openaire +1 more source
Eulerian and even-face ribbon graph minors
Discrete Mathematics, 2020Xian'An Jin, Metrose Metsidik
exaly
Graph Minors. XXII. Irrelevant vertices in linkage problems
Journal of Combinatorial Theory Series B, 2012Paul Seymour
exaly
Optimizing the Graph Minors Weak Structure Theorem
SIAM Journal on Discrete Mathematics, 2013Dimitrios M Thilikos +1 more
exaly
A characterization of some graph classes using excluded minors
Periodica Mathematica Hungarica, 2007Janka Chlebíková
exaly
Graph minors XXIII. Nash-Williams' immersion conjecture
Journal of Combinatorial Theory Series B, 2010Paul Seymour
exaly
Graph Minors and Reliable Single Message Transmission
SIAM Journal on Discrete Mathematics, 2005André Kündgen
exaly
Chi-boundedness of graph classes excluding wheel vertex-minors
Journal of Combinatorial Theory Series B, 2019Sang-Il Oum +2 more
exaly

