On the problem of finding disjoint cycles and dicycles in a digraph

DOI10.1007/s00493-011-2670-zzbMath1261.05047MaRDI QIDQ2428634

Matthias Kriesell, Jörgen Bang-Jensen

Publication date: 26 April 2012

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-011-2670-z

zbMATH Keywords

disjoint cycles; dicycles

Mathematics Subject Classification ID

05C38: Paths and cycles

05C85: Graph algorithms (graph-theoretic aspects)

05C20: Directed graphs (digraphs), tournaments

Related Items

On the Number of Vertex-Disjoint Cycles in Digraphs, Vertex-disjoint directed and undirected cycles in general digraphs, Arc-disjoint spanning sub(di)graphs in digraphs, Disjoint directed and undirected paths and cycles in digraphs, A note on the satisfactory partition problem: constant size requirement, Restricted cycle factors and arc-decompositions of digraphs, Arc-disjoint paths and trees in 2-regular digraphs, Finding good 2-partitions of digraphs. II. Enumerable properties, Arc-Disjoint Directed and Undirected Cycles in Digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Disjoint cycles in digraphs
• Disjoint directed and undirected paths and cycles in digraphs
• The 2-linkage problem for acyclic digraphs
• The directed subgraph homeomorphism problem
• Disjoint paths in acyclic digraphs
• Digraphs
• Some Results Concerning the Structure of Graphs