Arc-Disjoint Directed and Undirected Cycles in Digraphs
DOI10.1002/jgt.22006zbMath1350.05070OpenAlexW2292064525MaRDI QIDQ2833257
Alessandro Maddaloni, Sven Simonsen, Matthias Kriesell, Jörgen Bang-Jensen
Publication date: 17 November 2016
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.22006
cyclemixed problemdicyclecycle transversal numberdisjoint cycle problemarc-disjoint cycle problemtransversal arc
Paths and cycles (05C38) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)
Related Items (1)
Cites Work
- Vertex-disjoint directed and undirected cycles in general digraphs
- Arc-disjoint spanning sub(di)graphs in digraphs
- 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 graphs
- 2-linked graphs
- Highly connected non-2-linked digraphs
- On the problem of finding disjoint cycles and dicycles in a digraph
- ON DISJOINT CYCLES
- Digraphs
- Some Results Concerning the Structure of Graphs
This page was built for publication: Arc-Disjoint Directed and Undirected Cycles in Digraphs