Implications among linkage properties in graphs

DOI10.1002/JGT.20362zbMATH Open1182.05074OpenAlexW4245728272MaRDI QIDQ3633014FDOQ3633014

Qi Liu, Gexin Yu, Douglas B. West

Publication date: 16 June 2009

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20362

Recommendations

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

zbMATH Keywords

connectivityvertex cover\(H\)-linked\(k\)-ordered\(k\)-linked

Mathematics Subject Classification ID

Connectivity (05C40)

Cites Work

• An improved linear edge bound for graph linkages
• On \(H\)-linked graphs
• In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
• On Minimum Degree Implying That a Graph is H‐Linked
• An extremal problem for H‐linked graphs
• Minimum degree conditions for \(H\)-linked graphs
• On Sufficient Degree Conditions for a Graph to be $k$-linked
• Ore‐type degree conditions for a graph to be H‐linked

Cited In (3)

• Linkage for the diamond and the path with four vertices
• Optimal connectivity for fat-triangle linkages
• Combined Degree and Connectivity Conditions for $H$-Linked Graphs

This page was built for publication: Implications among linkage properties in graphs

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