A directed cycle packing in a digraph \(D\) is a subdigraph \(\mathcal C\) whose components are directed cycles. The size of \(\mathcal C\), as usual, is the number of arcs in \(\mathcal C\). A directed cycle packing \(\mathcal C\) is maximal if the subgraph induced by \(D\) on \(V(D)- V({\mathcal C})\) is acyclic; while it is maximum if no other directed cycle packing has size larger than the size of \(\mathcal C\). The author proves that for any directed multigraph \(D\), there is a vertex of \(D\) which lies in every maximum directed cycle packing of \(D\). She then points out that the corresponding problem for graphs is unsettled.
- Cycles in digraphs– a survey
- scientific article; zbMATH DE number 3522018 (Why is no real title available?)
- scientific article; zbMATH DE number 3577225 (Why is no real title available?)
- scientific article; zbMATH DE number 637534 (Why is no real title available?)
- scientific article; zbMATH DE number 3316740 (Why is no real title available?)
- Matching theory
- Packing cycles in graphs
- Packing cycles in graphs. II
- Maximum cycle packing in Eulerian graphs using local traces
- Packing cycles through prescribed vertices
- scientific article; zbMATH DE number 5914886 (Why is no real title available?)
- Scattered packings of cycles
- Induced Packing of Odd Cycles in a Planar Graph
- scientific article; zbMATH DE number 3968612 (Why is no real title available?)
- On maximum cycle packings in polyhedral graphs
- Approximability of Packing Disjoint Cycles
This page was built for publication: Cycle packings in graphs and digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1910593)
