Linkage for the diamond and the path with four vertices
From MaRDI portal
Publication:2897205
DOI10.1002/jgt.20612zbMath1244.05128OpenAlexW2154239812MaRDI QIDQ2897205
Michael D. Plummer, Gexin Yu, Mark N. Ellingham
Publication date: 10 July 2012
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20612
Related Items (6)
Combined Degree and Connectivity Conditions for $H$-Linked Graphs ⋮ Linking four vertices in graphs of large connectivity ⋮ Optimal connectivity for fat-triangle linkages ⋮ 7-connected graphs are 4-ordered ⋮ Connectivity for Kite-Linked Graphs ⋮ Rooted topological minors on four vertices
Cites Work
- Minimum degree conditions for \(H\)-linked graphs
- The extremal function for 3-linked graphs
- Disjoint paths in graphs
- 2-linked graphs
- Subdivisions in planar graphs
- Disjoint paths in graphs. I: 3-planar graphs and basic obstructions
- Disjoint paths in graphs. II: A special case
- An improved linear edge bound for graph linkages
- 4-connected maximal planar graphs are 4-ordered
- Graph minors. XIII: The disjoint paths problem
- On \(H\)-linked graphs
- (3,3)-linked planar graphs
- Homomorphieeigenschaften und mittlere Kantendichte von Graphen
- Eine Verallgemeinerung des \(n\)-fachen Zusammenhangs für Graphen
- Highly linked graphs
- On Sufficient Degree Conditions for a Graph to be $k$-linked
- Implications among linkage properties in graphs
- Ore‐type degree conditions for a graph to be H‐linked
- On Minimum Degree Implying That a Graph is H‐Linked
- On the Existence of Certain Configurations within Graphs and the 1-Skeletons of Polytopes
- An extremal problem for H‐linked graphs
- Survey of results on \(k\)-ordered graphs
This page was built for publication: Linkage for the diamond and the path with four vertices
