On digraphs with no two disjoint directed cycles

DOI10.1007/BF02579210zbMath0628.05034MaRDI QIDQ1092919

Carsten Thomassen

Publication date: 1987

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

algorithmconfigurationsNP- complete2-connected digraphsdisjoint dicycles

Mathematics Subject Classification ID

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

Related Items (6)

Nearly sign-nonsingular matrices ⋮ On cycles of directed graphs ⋮ Detecting stable matrices ⋮ Automaticity. II: Descriptional complexity in the unary case ⋮ Robust economic models ⋮ On the Number of Vertex-Disjoint Cycles in Digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• The 2-linkage problem for acyclic digraphs
• On the number of cycles possible in digraphs with large girth
• On cycles of directed graphs
• The directed subgraph homeomorphism problem
• Cycles in digraphs– a survey
• On independent circuits of a digraph
• A Minimax Theorem for Directed Graphs
• Some Results Concerning the Structure of Graphs

This page was built for publication: On digraphs with no two disjoint directed cycles