Erdős–Pósa property of obstructions to interval graphs
From MaRDI portal
Publication:6094044
Recommendations
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 4156480 (Why is no real title available?)
- scientific article; zbMATH DE number 1057879 (Why is no real title available?)
- scientific article; zbMATH DE number 795223 (Why is no real title available?)
- scientific article; zbMATH DE number 3332242 (Why is no real title available?)
- A Minimax Theorem for Directed Graphs
- 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
- Approximate min-max relations for odd cycles in planar graphs
- Covering a hypergraph of subgraphs
- Disjoint cycles intersecting a set of vertices
- Erdős-Pósa property of chordless cycles and its applications
- Fixed-parameter tractability for subset feedback set problems with parity constraints
- Graph Classes: A Survey
- Graph minors. V. Excluding a planar graph
- Graph theory with applications
- Highly parity linked graphs
- Interval deletion is fixed-parameter tractable
- Large-treewidth graph decompositions and applications
- Linear recognition of almost interval graphs
- Long cycles through prescribed vertices have the Erdős-Pósa property
- Mangoes and blueberries
- Non-zero disjoint cycles in highly connected group labelled graphs
- On Independent Circuits Contained in a Graph
- Packing and covering immersion-expansions of planar sub-cubic graphs
- Packing circuits in eulerian digraphs
- Packing cycles through prescribed vertices
- Packing directed circuits
- Packing directed circuits exactly
- Parity Linkage and the Erdős–Pósa Property of Odd Cycles through Prescribed Vertices in Highly Connected Graphs
- Quickly excluding a planar graph
- Recent techniques and results on the Erdős-Pósa property
- Representation of a finite graph by a set of intervals on the real line
- Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
- The Erdös-Pósa property for matroid circuits
- The Erdős-Pósa property for long circuits
- The Erdős-Pósa property for odd cycles in graphs of large connectivity
- The Erdős-Pósa property for odd cycles in highly connected graphs
- Two disjoint negative cycles in a signed graph
- VC-dimension and Erdős-Pósa property
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)
