Packing directed circuits
From MaRDI portal
Publication:1375699
DOI10.1007/BF01271272zbMath0881.05050OpenAlexW2079566953MaRDI QIDQ1375699
Robin Thomas, Neil Robertson, Bruce A. Reed, P. D. Seymour
Publication date: 11 January 1998
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01271272
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)
Related Items (42)
Fixed points in conjunctive networks and maximal independent sets in graph contractions ⋮ Kernelization of Arc Disjoint Cycle Packing in $$\alpha $$-Bounded Digraphs ⋮ Towards the Graph Minor Theorems for Directed Graphs ⋮ Packing and Covering Immersion Models of Planar Subcubic Graphs ⋮ On the feedback number of 3-uniform linear extremal hypergraphs ⋮ Frames, $A$-Paths, and the Erdös--Pósa Property ⋮ Approximate min-max relations on plane graphs ⋮ Packing and covering immersion-expansions of planar sub-cubic graphs ⋮ Recent techniques and results on the Erdős-Pósa property ⋮ Towards a polynomial kernel for directed feedback vertex set ⋮ Kernels for deletion to classes of acyclic digraphs ⋮ Erdös-Pósa Property of Obstructions to Interval Graphs ⋮ Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs ⋮ Complete acyclic colorings ⋮ Kernelization of arc disjoint cycle packing in \(\alpha\)-bounded digraphs ⋮ Number of Fixed Points and Disjoint Cycles in Monotone Boolean Networks ⋮ On the Erd\H{o}s-P\'osa property for immersions and topological minors in tournaments ⋮ Erdős–Pósa property of obstructions to interval graphs ⋮ Packing arc-disjoint cycles in oriented graphs ⋮ Two results on the digraph chromatic number ⋮ A unified half‐integral Erdős–Pósa theorem for cycles in graphs labelled by multiple abelian groups ⋮ Erdős-Pósa property of chordless cycles and its applications ⋮ Positive and negative cycles in Boolean networks ⋮ Finding a subdivision of a digraph ⋮ Packing directed circuits exactly ⋮ Chordless Cycle Packing Is Fixed-Parameter Tractable ⋮ Packing \(A\)-paths of length zero modulo four ⋮ Riemann-Roch theory for graph orientations ⋮ An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\) ⋮ Unnamed Item ⋮ Packing cycles through prescribed vertices ⋮ On the Number of Vertex-Disjoint Cycles in Digraphs ⋮ Packing and covering balls in graphs excluding a minor ⋮ Unnamed Item ⋮ Subdivisions in digraphs of large out-degree or large dichromatic number ⋮ Random Graphs with Few Disjoint Cycles ⋮ Parameterised algorithms for deletion to classes of DAGs ⋮ Graphs without two vertex-disjoint \(S\)-cycles ⋮ Euler Digraphs ⋮ Planar Digraphs ⋮ Digraphs of Bounded Width ⋮ Cycle Transversals in Tournaments with Few Vertex Disjoint Cycles
Cites Work
This page was built for publication: Packing directed circuits
