Directed graphs (digraphs), tournaments (05C20) Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Recommendations
Cites work
- scientific article; zbMATH DE number 475591 (Why is no real title available?)
- scientific article; zbMATH DE number 6469131 (Why is no real title available?)
- scientific article; zbMATH DE number 3225808 (Why is no real title available?)
- DAG-Width and Parity Games
- Directed tree-width
- Disjoint directed and undirected paths and cycles in digraphs
- Excluding induced subgraphs
- Finding a long directed cycle
- Graph minors. XIII: The disjoint paths problem
- Graph structure and monadic second-order logic. A language-theoretic approach
- Graph theory
- Highly connected non-2-linked digraphs
- Packing directed circuits
- Parameterized Approximability of the Disjoint Cycle Problem
- Parameterized tractability of edge-disjoint paths on directed acyclic graphs
- The directed subgraph homeomorphism problem
- The three-in-a-tree problem
Cited in
(4)
This page was built for publication: Finding a subdivision of a digraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q476873)
