Euler Digraphs (Q3120436)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Euler Digraphs	scientific article

Statements

scholarly article

0 references

Euler Digraphs (English)

0 references

Magnus Wahlström

0 references

Springer Monographs in Mathematics

0 references

publication date

4 March 2019

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-71840-8_4

0 references

0 references

0 references

Kernel bounds for disjoint cycles and disjoint paths

0 references

Disjoint cycles in Eulerian digraphs and the diameter of interchange graphs

0 references

0 references

Designing FPT Algorithms for Cut Problems Using Randomized Contractions

0 references

A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs

0 references

Packing non-zero \(A\)-paths in group-labelled graphs

0 references

The monadic second-order logic of graphs. I: Recognizable sets of finite graphs

0 references

Minimum bisection is fixed parameter tractable

0 references

Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time

0 references

0 references

Approximating minimum feedback sets and multicuts in directed graphs

0 references

0 references

The directed subgraph homeomorphism problem

0 references

0 references

Two Arc-Disjoint Paths in Eulerian Digraphs

0 references

Parameterized Approximability of the Disjoint Cycle Problem

0 references

Packing directed circuits exactly

0 references

0 references

Parameterized Directed $$k$$-Chinese Postman Problem and $$k$$ Arc-Disjoint Cycles Problem on Euler Digraphs

0 references

On duality and fractionality of multicommodity flows in directed networks

0 references

Weak Three-Linking in Eulerian Dgraphs

0 references

0 references

Some remarks on Arc‐connectivity, vertex splitting, and orientation in graphs and digraphs

0 references

Directed tree-width

0 references

The Directed Grid Theorem

0 references

The Minimum k-way Cut of Bounded Size is Fixed-Parameter Tractable

0 references

Faster deterministic \textsc{Feedback Vertex Set}

0 references

On some connectivity properties of Eulerian graphs

0 references

A Minimax Theorem for Directed Graphs

0 references

Finding small separators in linear time via treewidth reduction

0 references

Multiflow Feasibility: An Annotated Tableau

0 references

Packing non-returning A-paths

0 references

Packing directed circuits

0 references

Graph minors. XIII: The disjoint paths problem

0 references

A short proof of Mader's \(\mathcal S\)-paths theorem

0 references

Packing circuits in eulerian digraphs

0 references

Algorithms - ESA 2003

0 references

A 4 <i>k</i> <sup>2</sup> kernel for feedback vertex set

0 references

On Unicursal Paths in a Network of Degree 4

0 references

0 references

NP-completeness of some edge-disjoint paths problems

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-319-71840-8_4

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3120436

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3120436&oldid=36476664"