On large semi-linked graphs

DOI10.1016/j.disc.2014.08.022zbMath1302.05036OpenAlexW1982029422MaRDI QIDQ468447

Alexander Halperin, Colton Magnant, Hua Wang

Publication date: 7 November 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2014.08.022

zbMATH Keywords

minimum degreegraph linkedness

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pan-\(H\)-linked graphs
• Subdivision extendibility
• Minimum degree conditions for \(H\)-linked graphs
• An improved linear edge bound for graph linkages
• On \(H\)-linked graphs
• Eine Verallgemeinerung des \(n\)-fachen Zusammenhangs für Graphen
• New Ore-Type Conditions for H-Linked Graphs
• On Sufficient Degree Conditions for a Graph to be $k$-linked
• On Minimum Degree Implying That a Graph is H‐Linked
• An extremal problem for H‐linked graphs

This page was built for publication: On large semi-linked graphs