Rooted topological minors on four vertices
From MaRDI portal
Publication:2099413
DOI10.1016/j.jctb.2021.05.002zbMath1504.05272OpenAlexW3166092152MaRDI QIDQ2099413
Ken-ichi Kawarabayashi, Koyo Hayashi
Publication date: 23 November 2022
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2021.05.002
Graph minors (05C83) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Connectivity (05C40)
Related Items (1)
Cites Work
- Unnamed Item
- Independent paths and \(K_{5}\)-subdivisions
- Some remarks on Hajós' conjecture
- The Kelmans-Seymour conjecture. I: Special separations
- The Kelmans-Seymour conjecture. II: 2-vertices in \(K_4^-\)
- The Kelmans-Seymour conjecture. III: 3-vertices in \(K_4^-\)
- The Kelmans-Seymour conjecture. IV: A proof
- The extremal function for 3-linked graphs
- Disjoint paths in graphs
- 2-linked graphs
- A nine point theorem for 3-connected graphs
- Circuits through specified edges
- Cycles through specified vertices of a graph
- Über die Maximalzahl kreuzungsfreier H-Wege
- Hajos' graph-coloring conjecture: Variations and counterexamples
- Hadwiger's conjecture for \(K_ 6\)-free graphs
- Subdivisions in planar graphs
- Disjoint paths in graphs. I: 3-planar graphs and basic obstructions
- Disjoint paths in graphs. II: A special case
- Disjoint paths in graphs. III: Characterization
- Cycles through a prescribed vertex set in \(n\)-connected graphs.
- An improved linear edge bound for graph linkages
- On the conjecture of Hajos
- One or two disjoint circuits cover independent edges. Lovász-Woodall conjecture
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Subdivisions of \(K_5\) in graphs containing \(K_{2,3}\)
- Any 7-chromatic graph has \(K_7\) or \(K_{4,4}\) as a minor
- Reducing Hajós' 4-coloring conjecture to 4-connected graphs
- Applications of Menger's graph theorem
- Homomorphieeigenschaften und mittlere Kantendichte von Graphen
- Eine Verallgemeinerung des \(n\)-fachen Zusammenhangs für Graphen
- Linkage for the diamond and the path with four vertices
- In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
- A Polynomial Solution to the Undirected Two Paths Problem
- Circuits through prescribed vertices in k‐connected k‐regular graphs
- On the Existence of Certain Configurations within Graphs and the 1-Skeletons of Polytopes
- Cycles and Connectivity in Graphs
- Integer Programming and Combinatorial Optimization
- Connectivity for Kite-Linked Graphs
This page was built for publication: Rooted topological minors on four vertices
