On large semi-linked graphs

DOI10.1016/J.DISC.2014.08.022zbMATH Open1302.05036OpenAlexW1982029422MaRDI QIDQ468447FDOQ468447

Authors: 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

Recommendations

• On \(H\)-linked graphs
• On Minimum Degree Implying That a Graph is H‐Linked
• Ore‐type degree conditions for a graph to be H‐linked
• Minimum degree conditions for \(H\)-linked graphs
• An extremal problem for H‐linked graphs

zbMATH Keywords

minimum degreegraph linkedness

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

• Note on semi-linkage with almost prescribed lengths in large graphs
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q468447)