On Sufficient Degree Conditions for a Graph to be $k$-linked
From MaRDI portal
Publication:3412102
DOI10.1017/S0963548305007479zbMath1109.05061MaRDI QIDQ3412102
Gexin Yu, Ken-ichi Kawarabayashi, Alexandr V. Kostochka
Publication date: 5 December 2006
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Related Items (32)
The \(k\)-subconnectedness of planar graphs ⋮ Linkage for the diamond and the path with four vertices ⋮ Combined Degree and Connectivity Conditions for $H$-Linked Graphs ⋮ On the connectivity of minimum and minimal counterexamples to Hadwiger's conjecture ⋮ On Modulo Linked Graphs ⋮ Some recent progress and applications in graph minor theory ⋮ A minimum degree condition forcing a digraph to be k-linked ⋮ The linkedness of cubical polytopes: beyond the cube ⋮ Optimal connectivity for fat-triangle linkages ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ On large semi-linked graphs ⋮ Linkedness and Ordered Cycles in Digraphs ⋮ Linked graphs with restricted lengths ⋮ Degree Conditions for H-Linked Digraphs ⋮ An improved linear connectivity bound for tournaments to be highly linked ⋮ Minimum degree conditions for \(H\)-linked graphs ⋮ The extremal function for 3-linked graphs ⋮ \(k\)-Ordered Hamilton cycles in digraphs ⋮ Links in edge-colored graphs ⋮ Linkability in iterated line graphs ⋮ An improved linear edge bound for graph linkages ⋮ Forcing unbalanced complete bipartite minors ⋮ Non-zero disjoint cycles in highly connected group labelled graphs ⋮ Characterization of \(k\)-subconnected graphs ⋮ 7-connected graphs are 4-ordered ⋮ The linkedness of cubical polytopes: the cube ⋮ Implications among linkage properties in graphs ⋮ Minimum degree and pan-\(k\)-linked graphs ⋮ Linear connectivity forces large complete bipartite minors ⋮ A fan-type result on \(k\)-ordered graphs ⋮ Minimum degree condition for a graph to be knitted ⋮ Connectivity for Kite-Linked Graphs
This page was built for publication: On Sufficient Degree Conditions for a Graph to be $k$-linked
