Recommendations
Cites work
- 2-linked graphs
- 4-connected maximal planar graphs are 4-ordered
- 4-connected triangulations and 4-orderedness
- 7-connected graphs are 4-ordered
- \(3n-5\) edges do force a subdivision of \(K_5\)
- An improved linear edge bound for graph linkages
- Applications of Menger's graph theorem
- Cycle traversability for claw-free graphs and polyhedral maps
- Disjoint paths in 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
- Eine Verallgemeinerung des n-fachen Zusammenhangs für Graphen
- Highly linked graphs
- Homomorphieeigenschaften und mittlere Kantendichte von Graphen
- In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
- Linkage for the diamond and the path with four vertices
- 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
- The extremal function for 3-linked graphs
Cited in
(5)
This page was built for publication: Connectivity for kite-linked graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5857002)