Euler Digraphs
From MaRDI portal
Publication:3120436
DOI10.1007/978-3-319-71840-8_4zbMath1407.05116OpenAlexW4237267230MaRDI QIDQ3120436
Publication date: 4 March 2019
Published in: Springer Monographs in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-71840-8_4
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Kernel bounds for disjoint cycles and disjoint paths
- Packing directed circuits exactly
- On duality and fractionality of multicommodity flows in directed networks
- Packing non-zero \(A\)-paths in group-labelled graphs
- The directed subgraph homeomorphism problem
- A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs
- Packing directed circuits
- Approximating minimum feedback sets and multicuts in directed graphs
- Directed tree-width
- A short proof of Mader's \(\mathcal S\)-paths theorem
- Disjoint cycles in Eulerian digraphs and the diameter of interchange graphs
- Graph minors. XIII: The disjoint paths problem
- NP-completeness of some edge-disjoint paths problems
- Packing circuits in eulerian digraphs
- Faster deterministic \textsc{Feedback Vertex Set}
- Packing non-returning A-paths
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Graph Theory
- A 4 k 2 kernel for feedback vertex set
- Finding small separators in linear time via treewidth reduction
- The Directed Grid Theorem
- Parameterized Directed $$k$$-Chinese Postman Problem and $$k$$ Arc-Disjoint Cycles Problem on Euler Digraphs
- Multiflow Feasibility: An Annotated Tableau
- Designing FPT Algorithms for Cut Problems Using Randomized Contractions
- Some remarks on Arc‐connectivity, vertex splitting, and orientation in graphs and digraphs
- On some connectivity properties of Eulerian graphs
- A Minimax Theorem for Directed Graphs
- Two Arc-Disjoint Paths in Eulerian Digraphs
- Minimum bisection is fixed parameter tractable
- Parameterized Approximability of the Disjoint Cycle Problem
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- The Minimum k-way Cut of Bounded Size is Fixed-Parameter Tractable
- Digraphs
- Weak Three-Linking in Eulerian Dgraphs
- On Unicursal Paths in a Network of Degree 4
- Algorithms - ESA 2003
This page was built for publication: Euler Digraphs
