A minimum degree condition forcing a digraph to be k-linked

DOI10.1016/J.ENDM.2007.07.007MaRDI QIDQ3503449zbMATH OpenOpenAlexFDO

Authors Deryk Osthus, Daniela Kühn

Publication date 5 June 2008

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2007.07.007

zbMATH Keywords

digraphslinkednessminimum degree

Mathematics Subject Classification ID

Vertex degrees (05C07) Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Recommendations

• Linkedness and Ordered Cycles in Digraphs
• Improved results on linkage problems
• Degree conditions for \(H\)-linked digraphs
• k-linked and k-cyclic digraphs
• \(k\)-Ordered Hamilton cycles in digraphs

Cites work

• k-linked and k-cyclic digraphs
• About some cyclic properties in digraphs
• An improved linear edge bound for graph linkages
• Highly connected non-2-linked digraphs
• Highly linked graphs
• Linkedness and Ordered Cycles in Digraphs
• On Sufficient Degree Conditions for a Graph to be k-linked
• Onk-ordered Hamiltonian graphs
• Vertex-disjoint cycles containing specified edges

Cited in

(5)

• Minimum degree condition for a graph to be knitted
• Improved results on linkage problems
• Linkedness and Ordered Cycles in Digraphs
• Degree conditions for \(H\)-linked digraphs
• k-linked and k-cyclic digraphs

This page was built for publication: A minimum degree condition forcing a digraph to be k-linked

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