Vertex-disjoint directed and undirected cycles in general digraphs

DOI10.1016/j.jctb.2013.10.005zbMath1297.05095arXiv1106.5885OpenAlexW1965721173MaRDI QIDQ402588

Matthias Kriesell, Sven Simonsen, Alessandro Maddaloni, Jörgen Bang-Jensen

Publication date: 28 August 2014

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1106.5885

zbMATH Keywords

cyclemixed problemdicyclecycle transversal numberdisjoint cycle problemintercyclic digraphs

Mathematics Subject Classification ID

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

Related Items (6)

Finding good 2-partitions of digraphs. II. Enumerable properties ⋮ Arc-disjoint spanning sub(di)graphs in digraphs ⋮ (Arc-)disjoint flows in networks ⋮ On the Number of Vertex-Disjoint Cycles in Digraphs ⋮ Arc-Disjoint Directed and Undirected Cycles in Digraphs ⋮ Restricted cycle factors and arc-decompositions of digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Disjoint directed and undirected paths and cycles in digraphs
• The 2-linkage problem for acyclic digraphs
• The directed subgraph homeomorphism problem
• On the problem of finding disjoint cycles and dicycles in a digraph
• Arc-Disjoint Directed and Undirected Cycles in Digraphs
• ON DISJOINT CYCLES
• Digraphs
• Some Results Concerning the Structure of Graphs

This page was built for publication: Vertex-disjoint directed and undirected cycles in general digraphs