Erdős–Pósa property of obstructions to interval graphs
From MaRDI portal
Publication:6094044
DOI10.1002/JGT.22895zbMATH Open1522.05359MaRDI QIDQ6094044FDOQ6094044
Authors: Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi 
Publication date: 9 October 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Recommendations
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)
Cites Work
- Title not available (Why is that?)
- Graph Classes: A Survey
- Title not available (Why is that?)
- Non-zero disjoint cycles in highly connected group labelled graphs
- Graph theory with applications
- Title not available (Why is that?)
- Graph minors. V. Excluding a planar graph
- Mangoes and blueberries
- Quickly excluding a planar graph
- Representation of a finite graph by a set of intervals on the real line
- On Independent Circuits Contained in a Graph
- Approximate min-max relations for odd cycles in planar graphs
- Highly parity linked graphs
- Large-treewidth graph decompositions and applications
- A Minimax Theorem for Directed Graphs
- Packing cycles through prescribed vertices
- Covering a hypergraph of subgraphs
- Title not available (Why is that?)
- The Erdős-Pósa property for odd cycles in graphs of large connectivity
- Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
- Interval deletion is fixed-parameter tractable
- Packing directed circuits
- Packing circuits in eulerian digraphs
- The Erdös-Pósa property for matroid circuits
- Parity Linkage and the Erdős–Pósa Property of Odd Cycles through Prescribed Vertices in Highly Connected Graphs
- Disjoint cycles intersecting a set of vertices
- Linear recognition of almost interval graphs
- The Erdős-Pósa property for odd cycles in highly connected graphs
- Packing directed circuits exactly
- 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
- The Erdős-Pósa property for long circuits
- Long cycles through prescribed vertices have the Erdős-Pósa property
- VC-dimension and Erdős-Pósa property
- Title not available (Why is that?)
- Packing and covering immersion-expansions of planar sub-cubic graphs
- Two disjoint negative cycles in a signed graph
- Erdős-Pósa property of chordless cycles and its applications
- Fixed-parameter tractability for subset feedback set problems with parity constraints
Cited In (3)
This page was built for publication: Erdős–Pósa property of obstructions to interval graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6094044)
