Graph minors. IX: Disjoint crossed paths
From MaRDI portal
Publication:1813957
DOI10.1016/0095-8956(90)90063-6zbMath0741.05044OpenAlexW2061980451MaRDI QIDQ1813957
Publication date: 25 June 1992
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(90)90063-6
Related Items
Rooted minor problems in highly connected graphs, Excluding subdivisions of bounded degree graphs, Grids and their minors, Fixed-Parameter Tractability of Treewidth and Pathwidth, Minors in large almost-5-connected non-planar graphs, Obstructions for two-vertex alternating embeddings of graphs in surfaces, Non-planar extensions of subdivisions of planar graphs, Cyclically five-connected cubic graphs, Some recent progress and applications in graph minor theory, Linking four vertices in graphs of large connectivity, Projective plan and Möbius band obstructions, Obstructions for the Disk and the Cylinder Embedding Extension Problems, The disjoint shortest paths problem, \(K_{6}\) minors in 6-connected graphs of bounded tree-width, Packing topological minors half‐integrally, Linkless and flat embeddings in 3-space, Large non-planar graphs and an application to crossing-critical graphs, Graph minors. XVI: Excluding a non-planar graph, The theory of guaranteed search on graphs, Minimal \(k\)-connected non-Hamiltonian graphs, The extremal function for 3-linked graphs, Partitioning \(H\)-minor free graphs into three subgraphs with no large components, \(K_{6}\) minors in large 6-connected graphs, A new proof of the flat wall theorem, On almost-planar graphs, Case 6 of Hadwiger's conjecture. III: The problem of 7-vertices, Links in edge-colored graphs, The edge-disjoint paths problem is NP-complete for series-parallel graphs, Excluding a large theta graph, Graph minor theory, A Characterization of $K_{2,4}$-Minor-Free Graphs, Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction, A partial k-arboretum of graphs with bounded treewidth, Excluded minors in cubic graphs, List-coloring graphs without \(K_{4,k}\)-minors, Graphs with at most one crossing, The Kelmans-Seymour conjecture. II: 2-vertices in \(K_4^-\), The Kelmans-Seymour conjecture. III: 3-vertices in \(K_4^-\), \(K_{a,k}\) minors in graphs of bounded tree-width, Hadwiger's conjecture for \(K_ 6\)-free graphs
Cites Work
