ON DISJOINT CYCLES
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 219251
- A note on disjoint cycles
- Disjoint essential cycles
- On the existence of disjoint cycles in a graph
- Disjoint cycles with chords in graphs
- Disjoint chorded cycles in graphs
- Disjoint directed cycles
- Disjoint long cycles in a graph
- A Note on Vertex-Disjoint Cycles
- Disjointness in hypercyclicity
Cited in
(62)- Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3
- Disjoint essential cycles
- A partial k-arboretum of graphs with bounded treewidth
- On interval routing schemes and treewidth
- The decycling number of outerplanar graphs
- Faster deterministic \textsc{Feedback Vertex Set}
- Improved analysis of highest-degree branching for feedback vertex set
- On the complexity of singly connected vertex deletion
- Mim-width. II. The feedback vertex set problem
- Obtaining a planar graph by vertex deletion
- An improved parameterized algorithm for the independent feedback vertex set problem
- Eliminating cycles in the discrete torus
- The satisfactory partition problem
- Disjointness in hypercyclicity
- Parameterized complexity of fair feedback vertex set problem
- Packing arc-disjoint cycles in tournaments
- Arc-disjoint directed and undirected cycles in digraphs
- Fast partitioning l-apex graphs with applications to approximating maximum induced-subgraph problems
- Backdoors to satisfaction
- What's next? Future directions in parameterized complexity
- On the discrete bicycle transformation
- A quartic kernel for pathwidth-one vertex deletion
- A unified polynomial-time algorithm for feedback vertex set on graphs of bounded mim-width
- A Linear Kernel for Planar Feedback Vertex Set
- Iterative Compression for Exactly Solving NP-Hard Minimization Problems
- Cycle‐minors and subdivisions of wheels
- On the presence of disjoint subgraphs of a specified type
- Vertex-disjoint directed and undirected cycles in general digraphs
- A note on disjoint cycles
- scientific article; zbMATH DE number 219251 (Why is no real title available?)
- On feedback vertex set: new measure and new structures
- On the Complexity of Singly Connected Vertex Deletion
- Parameterized Complexity of Fair Feedback Vertex Set Problem
- Kernelization of Arc Disjoint Cycle Packing in \alpha -Bounded Digraphs
- Packing Arc-Disjoint Cycles in Tournaments
- scientific article; zbMATH DE number 7286685 (Why is no real title available?)
- Packing cycles faster than Erdős-Pósa
- Disjoint Chorded Cycles of the Same Length
- Parameterized Graph Cleaning Problems
- Inapproximability of \(H\)-transversal/packing
- Graphs with many vertex-disjoint cycles
- Arc‐Disjoint Cycles and Feedback Arc Sets
- An improved FPT algorithm for independent feedback vertex set
- The parameterized complexity of cycle packing: indifference is not an issue
- On dijoins
- Kernelization of arc disjoint cycle packing in -bounded digraphs
- A parameterized algorithm for subset feedback vertex set in tournaments
- Arkhipov's theorem, graph minors, and linear system nonlocal games
- On Interval Routing Schemes and treewidth
- Packing arc-disjoint cycles in oriented graphs
- Delineating half-integrality of the Erdős-Pósa property for minors: the case of surfaces
- On the complexity of list \(\mathcal{H}\)-packing for sparse graph classes
- Disjoint cycles intersecting a set of vertices
- Breaking the barrier 2ᵏ for subset feedback vertex set in chordal graphs
- Solving subset feedback vertex set in chordal graphs faster than 2ᵏ
- A simpler proof for the two disjoint odd cycles theorem
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
- Parameterized complexity of finding connected induced subgraphs
- Improved algorithms for feedback vertex set problems
- Parameterized graph cleaning problems
- A cubic kernel for feedback vertex set and loop cutset
- Satisfactory graph partition, variants, and generalizations
This page was built for publication: ON DISJOINT CYCLES
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4304619)
