Euler digraphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5485529 (Why is no real title available?)
- scientific article; zbMATH DE number 4103110 (Why is no real title available?)
- scientific article; zbMATH DE number 15460 (Why is no real title available?)
- scientific article; zbMATH DE number 908792 (Why is no real title available?)
- scientific article; zbMATH DE number 3068971 (Why is no real title available?)
- A Minimax Theorem for Directed Graphs
- A 4k^2 kernel for feedback vertex set
- A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs
- A short proof of Mader's \(\mathcal S\)-paths theorem
- Approximating minimum feedback sets and multicuts in directed graphs
- Designing FPT algorithms for cut problems using randomized contractions
- Digraphs
- Directed tree-width
- Disjoint cycles in Eulerian digraphs and the diameter of interchange graphs
- Faster deterministic \textsc{Feedback Vertex Set}
- Finding small separators in linear time via treewidth reduction
- Graph minors. XIII: The disjoint paths problem
- Graph theory
- Kernel bounds for disjoint cycles and disjoint paths
- Linear-time kernelization for feedback vertex set
- Minimum bisection is fixed parameter tractable
- Multiflow Feasibility: An Annotated Tableau
- NP-completeness of some edge-disjoint paths problems
- On Unicursal Paths in a Network of Degree 4
- On duality and fractionality of multicommodity flows in directed networks
- On some connectivity properties of Eulerian graphs
- Packing circuits in eulerian digraphs
- Packing directed circuits
- Packing directed circuits exactly
- Packing non-returning A-paths
- Packing non-zero \(A\)-paths in group-labelled graphs
- Parameterized Approximability of the Disjoint Cycle Problem
- Parameterized directed k-Chinese postman problem and k arc-disjoint cycles problem on Euler digraphs
- Parameterized tractability of edge-disjoint paths on directed acyclic graphs
- Simple proof of hardness of feedback vertex set
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- Some remarks on Arc‐connectivity, vertex splitting, and orientation in graphs and digraphs
- The directed grid theorem
- The directed subgraph homeomorphism problem
- The minimum k-way cut of bounded size is fixed-parameter tractable
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Two Arc-Disjoint Paths in Eulerian Digraphs
- Weak Three-Linking in Eulerian Dgraphs
Cited in
(20)- Eulerian and Hamiltonian dicycles in directed hypergraphs
- Minimal Eulerian Circuit in a Labeled Digraph
- Digraphs with exactly one Eulerian tour
- scientific article; zbMATH DE number 4103110 (Why is no real title available?)
- Anti-Eulerian digraphs
- An Eulerian exposition
- Weak Three-Linking in Eulerian Dgraphs
- Packing circuits in eulerian digraphs
- Simplicity in Eulerian circuits: uniqueness and safety
- Eulerian digraphs and toric Calabi-Yau varieties
- scientific article; zbMATH DE number 4162907 (Why is no real title available?)
- Pickup and delivery problems with autonomous vehicles on rings
- A proof of some Schützenberger-type results for Eulerian paths and circuits on digraphs
- Closed models, strongly connected components and Euler graphs
- scientific article; zbMATH DE number 3946164 (Why is no real title available?)
- Delta invariant for Eulerian digraphs
- On the number of Euler trails in directed graphs
- Two arc disjoint paths in Eulerian digraphs
- scientific article; zbMATH DE number 3974985 (Why is no real title available?)
- Dyck-Eulerian digraphs
This page was built for publication: Euler digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3120436)
