An extremal problem for H‐linked graphs
From MaRDI portal
Publication:5711700
DOI10.1002/jgt.20115zbMath1078.05042OpenAlexW2323792666MaRDI QIDQ5711700
Gexin Yu, Alexandr V. Kostochka
Publication date: 8 December 2005
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20115
Related Items (15)
Linkage for the diamond and the path with four vertices ⋮ 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 ⋮ Minimum degree conditions for \(H\)-linked graphs ⋮ On \(H\)-linked graphs ⋮ 7-connected graphs are 4-ordered ⋮ Connectivities for \(k\)-knitted graphs and for minimal counterexamples to Hadwiger's conjecture ⋮ Implications among linkage properties in graphs ⋮ Minimum degree condition for a graph to be knitted ⋮ A look at cycles containing specified elements of a graph
This page was built for publication: An extremal problem for H‐linked graphs