Minors in large almost-5-connected non-planar graphs
From MaRDI portal
Publication:2911058
DOI10.1002/jgt.20637zbMath1248.05196OpenAlexW2154104378MaRDI QIDQ2911058
Ken-ichi Kawarabayashi, John Maharry
Publication date: 12 September 2012
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20637
Graph minors (05C83) Connectivity (05C40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- \(K_{6}\) minors in large 6-connected graphs
- Typical subgraphs of 3- and 4-connected graphs
- Linear connectivity forces large complete bipartite minors
- Quickly excluding a planar graph
- Graph minors. IX: Disjoint crossed paths
- A characterization of graphs with no cube minor
- On a certain homomorphism properties of graphs II.
- An excluded minor theorem for the Octahedron plus an edge
- On Certain Homomorphism Properties of Graphs I.
This page was built for publication: Minors in large almost-5-connected non-planar graphs
