Connectivity for Kite-Linked Graphs
From MaRDI portal
Publication:5857002
DOI10.1137/19M130282XzbMath1460.05101MaRDI QIDQ5857002
No author found.
Publication date: 30 March 2021
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Related Items (3)
Linking four vertices in graphs of large connectivity ⋮ Optimal connectivity for fat-triangle linkages ⋮ Rooted topological minors on four vertices
Cites Work
- 4-connected triangulations and 4-orderedness
- The extremal function for 3-linked graphs
- Disjoint paths in graphs
- 2-linked graphs
- \(3n-5\) edges do force a subdivision of \(K_5\)
- 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
- An improved linear edge bound for graph linkages
- 4-connected maximal planar graphs are 4-ordered
- Cycle traversability for claw-free graphs and polyhedral maps
- 7-connected graphs are 4-ordered
- Applications of Menger's graph theorem
- Homomorphieeigenschaften und mittlere Kantendichte von Graphen
- Eine Verallgemeinerung des \(n\)-fachen Zusammenhangs für Graphen
- Highly linked graphs
- Linkage for the diamond and the path with four vertices
- In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
- On Sufficient Degree Conditions for a Graph to be $k$-linked
- On the Existence of Certain Configurations within Graphs and the 1-Skeletons of Polytopes
- Survey of results on \(k\)-ordered graphs
This page was built for publication: Connectivity for Kite-Linked Graphs