Rooted \(K_4\)-minors
From MaRDI portal
Publication:396793
zbMath1295.05218arXiv1102.3760MaRDI QIDQ396793
David R. Wood, Ruy Fabila-Monroy
Publication date: 14 August 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1102.3760
Related Items (4)
Strengthening Hadwiger's conjecture for 4- and 5-chromatic graphs ⋮ Properties of 8-contraction-critical graphs with no \(K_7\) minor ⋮ A Characterization of $K_{2,4}$-Minor-Free Graphs ⋮ Unique Colorability and Clique Minors
Cites Work
- The disjoint paths problem in quadratic time
- Pan-\(H\)-linked graphs
- A simple solution to the two paths problem in planar graphs
- Minimum degree conditions for \(H\)-linked graphs
- Graph minors XXIII. Nash-Williams' immersion conjecture
- Disjoint paths in graphs
- 2-linked graphs
- Hadwiger's conjecture for \(K_ 6\)-free graphs
- Rooted minor problems in highly connected graphs
- Graph minors. XIII: The disjoint paths problem
- Solving the 2-disjoint paths problem in nearly linear time
- On \(H\)-linked graphs
- On the existence of certain disjoint arcs in graphs
- Eine Verallgemeinerung des \(n\)-fachen Zusammenhangs für Graphen
- New Ore-Type Conditions for H-Linked Graphs
- Thomassen's Choosability Argument Revisited
- In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
- Extremal functions for rooted minors
- A Very Practical Algorithm for the Two-Paths Problem in 3-Connected Planar Graphs
- A Polynomial Solution to the Undirected Two Paths Problem
- Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
- 2-Isomorphic Graphs
- Extremal results for rooted minor problems
- On Minimum Degree Implying That a Graph is H‐Linked
- Optimization and Recognition for K 5-minor Free Graphs in Linear Time
- An extremal problem for H‐linked graphs
This page was built for publication: Rooted \(K_4\)-minors
