Combined Degree and Connectivity Conditions for $H$-Linked Graphs
From MaRDI portal
Publication:3453612
DOI10.1137/140974419zbMath1327.05185arXiv1206.1427OpenAlexW2047753205MaRDI QIDQ3453612
Publication date: 27 November 2015
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1206.1427
Cites Work
- Unnamed Item
- The extremal function for 3-linked graphs
- Disjoint paths in graphs. III: Characterization
- An improved linear edge bound for graph linkages
- Eine Verallgemeinerung des \(n\)-fachen Zusammenhangs für Graphen
- Linkage for the diamond and the path with four vertices
- On Sufficient Degree Conditions for a Graph to be $k$-linked
- Implications among linkage properties in graphs
- Some Theorems on Abstract Graphs
This page was built for publication: Combined Degree and Connectivity Conditions for $H$-Linked Graphs