The 2-linkage problem for acyclic digraphs

DOI10.1016/S0012-365X(85)80022-4zbMath0563.05027OpenAlexW2025391779MaRDI QIDQ1057282

Carsten Thomassen

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(85)80022-4

zbMATH Keywords

directed pathsacyclic digraphdistinct cyclesshortest cycles

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Directed graphs (digraphs), tournaments (05C20)

Related Items (15)

Characterization of even directed graphs ⋮ On digraphs with no two disjoint directed cycles ⋮ Nearly sign-nonsingular matrices ⋮ Linear time algorithms for two disjoint paths problems on directed acyclic graphs ⋮ Vertex-disjoint directed and undirected cycles in general digraphs ⋮ On the problem of finding disjoint cycles and dicycles in a digraph ⋮ Hoàng-Reed conjecture holds for tournaments ⋮ Existence of openly disjoint circuits through a vertex ⋮ The Hoàng-Reed conjecture for \(\delta ^{+}=3\) ⋮ Openly disjoint circuits through a vertex in regular digraphs ⋮ A note on short cycles in digraphs ⋮ Arc-Disjoint Directed and Undirected Cycles in Digraphs ⋮ Linkages in locally semicomplete digraphs and quasi-transitive digraphs ⋮ Tournaments and Semicomplete Digraphs ⋮ Sign-nonsingular matrices and even cycles in directed graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Disjoint cycles in digraphs
• On the number of cycles possible in digraphs with large girth
• The directed subgraph homeomorphism problem
• Planarity and duality of finite and infinite graphs
• Disjoint paths in graphs
• 2-linked graphs
• Cycles in digraphs– a survey
• Efficient Planarity Testing
• On independent circuits of a digraph

This page was built for publication: The 2-linkage problem for acyclic digraphs