Linkedness and Ordered Cycles in Digraphs

DOI10.1017/S0963548307008759zbMath1162.05025arXiv0704.0211OpenAlexW2156630912MaRDI QIDQ3545906

Daniela Kühn, Deryk Osthus

Publication date: 11 December 2008

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0704.0211

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

A minimum degree condition forcing a digraph to be k-linked ⋮ \(k\)-Ordered Hamilton cycles in digraphs ⋮ Links in edge-colored graphs ⋮ Basic Terminology, Notation and Results

Cites Work

• \(k\)-linked and \(k\)-cyclic digraphs
• About some cyclic properties in digraphs
• The directed subgraph homeomorphism problem
• Highly connected non-2-linked digraphs
• An improved linear edge bound for graph linkages
• Vertex-disjoint cycles containing specified edges
• On \(H\)-linked graphs
• Eine Verallgemeinerung des \(n\)-fachen Zusammenhangs für Graphen
• Highly linked graphs
• On Sufficient Degree Conditions for a Graph to be $k$-linked
• Linear forests and ordered cycles
• On Minimum Degree Implying That a Graph is H‐Linked
• An extremal problem for H‐linked graphs

This page was built for publication: Linkedness and Ordered Cycles in Digraphs