Minimum degree and pan-\(k\)-linked graphs

DOI10.1016/j.disc.2008.07.038zbMath1229.05144OpenAlexW2007513792MaRDI QIDQ1025918

Brian C. Wagner, Thor C. Whalen, Ronald J. Gould, Jeffrey Scott Powell

Publication date: 23 June 2009

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

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

zbMATH Keywords

extendabilityminimum degreepanconnectedpath system\(k\)-linked

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

Related Items (1)

Pan-\(H\)-linked graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Path extendable graphs
• Subdivision extendibility
• Panconnected graphs. II
• A sufficient condition for all short cycles
• An improved linear edge bound for graph linkages
• On Sufficient Degree Conditions for a Graph to be $k$-linked
• Path connected graphs
• Weakly pancyclic graphs
• K-linked graphs with girth condition

This page was built for publication: Minimum degree and pan-\(k\)-linked graphs