Minimum feedback arc set of m-free digraphs
From MaRDI portal
Abstract: For a simple digraph , let be the size of the smallest subset such that has no directed cycles, and let be the number of unordered pairs of nonadjacent vertices in . A digraph is called -free if has no directed cycles of length at most . This paper proves that for any -free digraph , which generalized some known results.
Recommendations
- On Sullivan's conjecture on cycles in 4-free and 5-free digraphs
- Directed graphs without short cycles
- Large feedback arc sets, high minimum degree subgraphs, and long cycles in Eulerian digraphs
- 3-free strong digraphs with the maximum size
- On Seymour's second neighborhood conjecture of \(m\)-free digraphs
Cited in
(10)- On Sullivan's conjecture on cycles in 4-free and 5-free digraphs
- 3-free strong digraphs with the maximum size
- On Seymour's second neighborhood conjecture of \(m\)-free digraphs
- Directed graphs without short cycles
- Finding a minimum feedback arc set in reducible flow graphs
- scientific article; zbMATH DE number 1762085 (Why is no real title available?)
- Large feedback arc sets, high minimum degree subgraphs, and long cycles in Eulerian digraphs
- On signed digraphs with all cycles negative
- Extremal results on feedback arc sets in digraphs
- 4-Free Strong Digraphs with the Maximum Size
This page was built for publication: Minimum feedback arc set of \(m\)-free digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2377233)