On Minimum Degree Implying That a Graph is H‐Linked

DOI10.1137/050624662zbMath1127.05059OpenAlexW1996975178MaRDI QIDQ5426876

Ronald J. Gould, Gexin Yu, Alexandr V. Kostochka

Publication date: 16 November 2007

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

Full work available at URL: https://doi.org/10.1137/050624662

zbMATH Keywords

connectivity\(H\)-linked\(k\)-linkedMinimum degree

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40)

Related Items

Linkage for the diamond and the path with four vertices ⋮ New Ore-Type Conditions for H-Linked Graphs ⋮ Pan-\(H\)-linked graphs ⋮ Rooted \(K_4\)-minors ⋮ Optimal connectivity for fat-triangle linkages ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ On large semi-linked graphs ⋮ Linkedness and Ordered Cycles in Digraphs ⋮ Degree Conditions for H-Linked Digraphs ⋮ Implications among linkage properties in graphs