On the presence of disjoint subgraphs of a specified type
From MaRDI portal
Publication:3812269
DOI10.1002/jgt.3190120111zbMath0662.05032OpenAlexW2096113666MaRDI QIDQ3812269
Publication date: 1988
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190120111
Related Items (45)
The edge-Erdős-Pósa property ⋮ A tight Erdős-Pósa function for long cycles ⋮ Frames, $A$-Paths, and the Erdös--Pósa Property ⋮ The Erdős-Pósa property for vertex- and edge-disjoint odd cycles in graphs on orientable surfaces ⋮ Packing and covering immersion-expansions of planar sub-cubic graphs ⋮ Recent techniques and results on the Erdős-Pósa property ⋮ Some recent progress and applications in graph minor theory ⋮ Quick but odd growth of cacti ⋮ Packing cycles in undirected group-labelled graphs ⋮ Number of Fixed Points and Disjoint Cycles in Monotone Boolean Networks ⋮ Large Induced Subgraphs via Triangulations and CMSO ⋮ Even A‐cycles have the edge‐Erdős–Pósa property ⋮ A unified half‐integral Erdős–Pósa theorem for cycles in graphs labelled by multiple abelian groups ⋮ Erdős-Pósa property of chordless cycles and its applications ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Packing cycles through prescribed vertices under modularity constraints ⋮ Minimum degree conditions for vertex-disjoint even cycles in large graphs ⋮ A Tight Erdös--Pósa Function for Wheel Minors ⋮ Erdös--Pósa from Ball Packing ⋮ Packing cycles with modularity constraints ⋮ Towards tight(er) bounds for the excluded grid theorem ⋮ A gentle introduction to applications of algorithmic metatheorems for space and circuit classes ⋮ Packing \(A\)-paths of length zero modulo four ⋮ The Erdős-Pósa property for edge-disjoint immersions in 4-edge-connected graphs ⋮ Random graphs containing few disjoint excluded minors ⋮ Half-integral packing of odd cycles through prescribed vertices ⋮ The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey ⋮ Non-zero disjoint cycles in highly connected group labelled graphs ⋮ Packing cycles through prescribed vertices ⋮ Strengthening Erdös-Pósa property for minor-closed graph classes ⋮ The Impact of Locality in the Broadcast Congested Clique Model ⋮ Packing and Covering Induced Subdivisions ⋮ Erdös--Pósa Property for Labeled Minors: 2-Connected Minors ⋮ Edge-disjoint odd cycles in graphs with small chromatic numbers ⋮ Graphs without two vertex-disjoint \(S\)-cycles ⋮ Disjoint Even Cycles Packing ⋮ In absence of long chordless cycles, large tree-width becomes a local phenomenon ⋮ $K_4$-Subdivisions Have the Edge-Erdös--Pósa Property ⋮ Well-quasi-ordering digraphs with no long alternating paths by the strong immersion relation ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Quadratic Upper Bounds on the Erdős-Pósa Property for a Generalization of Packing and Covering Cycles ⋮ Fixed-parameter tractability for subset feedback set problems with parity constraints ⋮ Non-zero disjoint cycles in highly connected group labeled graphs
Cites Work
This page was built for publication: On the presence of disjoint subgraphs of a specified type
