On the problem of finding disjoint cycles and dicycles in a digraph
From MaRDI portal
Publication:2428634
DOI10.1007/s00493-011-2670-zzbMath1261.05047OpenAlexW1988011810MaRDI 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
Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)
Related Items (9)
Finding good 2-partitions of digraphs. II. Enumerable properties ⋮ Vertex-disjoint directed and undirected cycles in general digraphs ⋮ Arc-disjoint spanning sub(di)graphs in digraphs ⋮ Arc-disjoint paths and trees in 2-regular digraphs ⋮ On the Number of Vertex-Disjoint Cycles in Digraphs ⋮ Arc-Disjoint Directed and Undirected Cycles 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
Cites Work
This page was built for publication: On the problem of finding disjoint cycles and dicycles in a digraph