Erdős-Pósa property of chordless cycles and its applications
From MaRDI portal
Publication:2200918
DOI10.1016/J.JCTB.2020.05.002zbMATH Open1448.05115OpenAlexW3028034187MaRDI QIDQ2200918FDOQ2200918
Authors: Eun Jung Kim, O-joung Kwon 
Publication date: 24 September 2020
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2020.05.002
Recommendations
Cites Work
- Graph minors. V. Excluding a planar graph
- Mangoes and blueberries
- On Independent Circuits Contained in a Graph
- Chordal deletion is fixed-parameter tractable
- Packing cycles in graphs
- Packing cycles through prescribed vertices
- The Erdős-Pósa property for edge-disjoint immersions in 4-edge-connected graphs
- Packing directed circuits
- On the presence of disjoint subgraphs of a specified type
- Disjoint cycles intersecting a set of vertices
- Packing directed circuits through prescribed vertices bounded fractionally
- A new proof and generalizations of a theorem of Erdős and Pósa on graphs withoutk+1 independent circuits
- A tight Erdős-Pósa function for long cycles
- Recent techniques and results on the Erdős-Pósa property
- A unified Erdős-Pósa theorem for constrained cycles
- The Erdős-Pósa property for long circuits
- A tighter Erdős-Pósa function for long cycles
- Long cycles through prescribed vertices have the Erdős-Pósa property
- Approximation and kernelization for chordal vertex deletion
- Feedback vertex set inspired kernel for chordal vertex deletion
- Packing and covering immersion-expansions of planar sub-cubic graphs
- Polylogarithmic approximation algorithms for weighted-\(\mathcal{F}\)-deletion problems
Cited In (13)
- Title not available (Why is that?)
- On the Erdős–Pósa Property for Long Holes in \(\boldsymbol{C_4}\)-Free Graphs
- Erdös-Pósa Property of Obstructions to Interval Graphs
- On the feedback number of 3-uniform linear extremal hypergraphs
- Towards constant-factor approximation for chordal/distance-hereditary vertex deletion
- Towards a conjecture of Birmelé–Bondy–Reed on the Erdős–Pósa property of long cycles
- Structural parameterizations with modulator oblivion
- The Erdős-Pósa property for long circuits
- Erdős–Pósa property of obstructions to interval graphs
- Packing and covering induced subdivisions
- The Erdős-Pósa property for odd cycles in highly connected graphs
- A unified Erdős-Pósa theorem for constrained cycles
- Erdős-Pósa property of chordless cycles and its applications
This page was built for publication: Erdős-Pósa property of chordless cycles and its applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2200918)
