Rooted topological minors on four vertices
type: Item
instance of: scholarly article
title: Rooted topological minors on four vertices
zbMATH Open document ID: 1504.05272
author: Koyo Hayashi
author: Ken-ichi Kawarabayashi
published in: Journal of Combinatorial Theory. Series B
publication date: 2022-11-23T00:00:00Z
Mathematics Subject Classification ID: 05C83
Mathematics Subject Classification ID: 05C78
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 7622602
zbMATH Keywords: rooted subdivision
zbMATH Keywords: connectivity
zbMATH Keywords: separation
zbMATH Keywords: Mader's \(S\)-paths theorem
MaRDI profile type: Publication
full work available at URL: j.jctb.2021.05.002
OpenAlex ID: W3166092152
cites work: Cycles through specified vertices of a graph
cites work: Hajos' graph-coloring conjecture: Variations and counterexamples
cites work: In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
cites work: Linkage for the diamond and the path with four vertices
cites work: On the conjecture of Hajos
cites work: The Kelmans-Seymour conjecture. I: Special separations
cites work: The Kelmans-Seymour conjecture. II: 2-vertices in \(K_4^-\)
cites work: The Kelmans-Seymour conjecture. III: 3-vertices in \(K_4^-\)
cites work: The Kelmans-Seymour conjecture. IV: A proof
cites work: A nine point theorem for 3-connected graphs
cites work: Circuits through prescribed vertices in k‐connected k‐regular graphs
cites work: Circuits through specified edges
cites work: Eine Verallgemeinerung des \(n\)-fachen Zusammenhangs für Graphen
cites work: One or two disjoint circuits cover independent edges. Lovász-Woodall conjecture
cites work: Cycles through a prescribed vertex set in \(n\)-connected graphs.
cites work: Any 7-chromatic graph has \(K_7\) or \(K_{4,4}\) as a minor
cites work: Subdivisions of \(K_5\) in graphs containing \(K_{2,3}\)
cites work: On the Existence of Certain Configurations within Graphs and the 1-Skeletons of Polytopes
cites work: Q3972952
cites work: Independent paths and \(K_{5}\)-subdivisions
cites work: Homomorphieeigenschaften und mittlere Kantendichte von Graphen
cites work: Über die Maximalzahl kreuzungsfreier H-Wege
cites work: Applications of Menger's graph theorem
cites work: Hadwiger's conjecture for \(K_ 6\)-free graphs
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: Integer Programming and Combinatorial Optimization
cites work: Disjoint paths in graphs
cites work: A Polynomial Solution to the Undirected Two Paths Problem
cites work: Connectivity for Kite-Linked Graphs
cites work: An improved linear edge bound for graph linkages
cites work: The extremal function for 3-linked graphs
cites work: 2-linked graphs
cites work: Some remarks on Hajós' conjecture
cites work: Subdivisions in planar graphs
cites work: Disjoint paths in graphs. I: 3-planar graphs and basic obstructions
cites work: Disjoint paths in graphs. II: A special case
cites work: Disjoint paths in graphs. III: Characterization
cites work: Reducing Hajós' 4-coloring conjecture to 4-connected graphs
cites work: Cycles and Connectivity in Graphs
DOI: 10.1016/J.JCTB.2021.05.002
description: scientific article; zbMATH DE number 7622602