Euler Digraphs (Q3120436): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4888115 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernel bounds for disjoint cycles and disjoint paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint cycles in Eulerian digraphs and the diameter of interchange graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Designing FPT Algorithms for Cut Problems Using Randomized Contractions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing non-zero \(A\)-paths in group-labelled graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum bisection is fixed parameter tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating minimum feedback sets and multicuts in directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3972098 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The directed subgraph homeomorphism problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3828033 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Arc-Disjoint Paths in Eulerian Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Approximability of the Disjoint Cycle Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing directed circuits exactly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2816412 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Directed $$k$$-Chinese Postman Problem and $$k$$ Arc-Disjoint Cycles Problem on Euler Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On duality and fractionality of multicommodity flows in directed networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak Three-Linking in Eulerian Dgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111399 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on Arc‐connectivity, vertex splitting, and orientation in graphs and digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Directed Grid Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Minimum k-way Cut of Bounded Size is Fixed-Parameter Tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster deterministic \textsc{Feedback Vertex Set} / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some connectivity properties of Eulerian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Minimax Theorem for Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding small separators in linear time via treewidth reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiflow Feasibility: An Annotated Tableau / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing non-returning A-paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing directed circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XIII: The disjoint paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof of Mader's \(\mathcal S\)-paths theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing circuits in eulerian digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 4 <i>k</i> <sup>2</sup> kernel for feedback vertex set / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Unicursal Paths in a Network of Degree 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5808057 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-completeness of some edge-disjoint paths problems / rank
 
Normal rank

Latest revision as of 10:24, 18 July 2024

scientific article
Language Label Description Also known as
English
Euler Digraphs
scientific article

    Statements

    Euler Digraphs (English)
    0 references
    0 references
    4 March 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers