Minimum degree conditions for \(H\)-linked graphs

DOI10.1016/j.dam.2006.11.013zbMath1144.05039OpenAlexW2098792571MaRDI QIDQ947099

Gexin Yu, Alexandr V. Kostochka

Publication date: 29 September 2008

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

Full work available at URL: https://doi.org/10.1016/j.dam.2006.11.013

zbMATH Keywords

degree conditions\(H\)-linked graphsextremal graph problems

Mathematics Subject Classification ID

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

Related Items

Linkage for the diamond and the path with four vertices ⋮ New Ore-Type Conditions for 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 ⋮ On large semi-linked graphs ⋮ Degree Conditions for H-Linked Digraphs ⋮ Implications among linkage properties in graphs

Cites Work

• Advances on the Hamiltonian problem -- a survey
• An improved linear edge bound for graph linkages
• Vertex-disjoint cycles containing specified edges
• On Sufficient Degree Conditions for a Graph to be $k$-linked
• Onk-ordered Hamiltonian graphs
• Onk-ordered graphs
• k-ordered Hamiltonian graphs
• An extremal problem for H‐linked graphs