The following pages link to Packing directed circuits (Q1375699):
Displaying 42 items.
- Approximate min-max relations on plane graphs (Q358640) (← links)
- Two results on the digraph chromatic number (Q418896) (← links)
- Finding a subdivision of a digraph (Q476873) (← links)
- Riemann-Roch theory for graph orientations (Q509688) (← links)
- Packing directed circuits exactly (Q663091) (← links)
- Graphs without two vertex-disjoint \(S\)-cycles (Q785795) (← links)
- Kernels for deletion to classes of acyclic digraphs (Q1678165) (← links)
- Positive and negative cycles in Boolean networks (Q1717061) (← links)
- An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\) (Q1751097) (← links)
- Packing and covering balls in graphs excluding a minor (Q2043760) (← links)
- On the feedback number of 3-uniform linear extremal hypergraphs (Q2150590) (← links)
- Complete acyclic colorings (Q2185231) (← links)
- Erdős-Pósa property of chordless cycles and its applications (Q2200918) (← links)
- Packing \(A\)-paths of length zero modulo four (Q2237857) (← links)
- Packing cycles through prescribed vertices (Q2275896) (← links)
- Subdivisions in digraphs of large out-degree or large dichromatic number (Q2315440) (← links)
- Parameterised algorithms for deletion to classes of DAGs (Q2322699) (← links)
- Fixed points in conjunctive networks and maximal independent sets in graph contractions (Q2361351) (← links)
- Packing and covering immersion-expansions of planar sub-cubic graphs (Q2400977) (← links)
- Recent techniques and results on the Erdős-Pósa property (Q2403789) (← links)
- Towards a polynomial kernel for directed feedback vertex set (Q2663705) (← links)
- Random Graphs with Few Disjoint Cycles (Q3103626) (← links)
- Euler Digraphs (Q3120436) (← links)
- Planar Digraphs (Q3120437) (← links)
- Digraphs of Bounded Width (Q3120441) (← links)
- Packing and Covering Immersion Models of Planar Subcubic Graphs (Q3181048) (← links)
- Erdös-Pósa Property of Obstructions to Interval Graphs (Q3304101) (← links)
- Towards the Graph Minor Theorems for Directed Graphs (Q3449461) (← links)
- Frames, $A$-Paths, and the Erdös--Pósa Property (Q4564886) (← links)
- Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs (Q4582017) (← links)
- Kernelization of Arc Disjoint Cycle Packing in $$\alpha $$-Bounded Digraphs (Q5042259) (← links)
- (Q5075819) (← links)
- (Q5111250) (← links)
- On the Number of Vertex-Disjoint Cycles in Digraphs (Q5205389) (← links)
- Cycle Transversals in Tournaments with Few Vertex Disjoint Cycles (Q5265333) (← links)
- Number of Fixed Points and Disjoint Cycles in Monotone Boolean Networks (Q5348493) (← links)
- Chordless Cycle Packing Is Fixed-Parameter Tractable (Q5874543) (← links)
- Kernelization of arc disjoint cycle packing in \(\alpha\)-bounded digraphs (Q6038707) (← links)
- On the Erd\H{o}s-P\'osa property for immersions and topological minors in tournaments (Q6045407) (← links)
- Erdős–Pósa property of obstructions to interval graphs (Q6094044) (← links)
- Packing arc-disjoint cycles in oriented graphs (Q6126480) (← links)
- A unified half‐integral Erdős–Pósa theorem for cycles in graphs labelled by multiple abelian groups (Q6199337) (← links)
