Linking four vertices in graphs of large connectivity
From MaRDI portal
Publication:2668016
DOI10.1016/j.jctb.2021.12.007zbMath1484.05115OpenAlexW4205664234MaRDI QIDQ2668016
Publication date: 3 March 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.12.007
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)
Cites Work
- 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
- Disjoint paths in graphs
- 2-linked graphs
- Hajos' graph-coloring conjecture: Variations and counterexamples
- Topological subgraphs in graphs of large girth
- 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
- Topological minors in graphs of large girth
- Disjoint paths in graphs. III: Characterization
- An improved linear edge bound for graph linkages
- Graph minors. IX: Disjoint crossed paths
- Graph minors. XIII: The disjoint paths problem
- 7-connected graphs are 4-ordered
- 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
- A Polynomial Solution to the Undirected Two Paths Problem
- On the Computational Complexity of Combinatorial Problems
- On the Existence of Certain Configurations within Graphs and the 1-Skeletons of Polytopes
- Connectivity for Kite-Linked Graphs
This page was built for publication: Linking four vertices in graphs of large connectivity
