Packing and Covering Induced Subdivisions
From MaRDI portal
Publication:4986803
DOI10.1137/18M1226166zbMath1462.05300arXiv1803.07581MaRDI QIDQ4986803
O-joung Kwon, Jean-Florent Raymond
Publication date: 28 April 2021
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.07581
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New spectral lower bounds on the bisection width of graphs
- Graph minors. V. Excluding a planar graph
- Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
- \(K_4\)-expansions have the edge-Erdős-Pósa property
- An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\)
- Erdős-Pósa property of chordless cycles and its applications
- In absence of long chordless cycles, large tree-width becomes a local phenomenon
- 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
- Hitting Forbidden Minors: Approximation and Kernelization
- Graph Theory
- A Tighter Erdős-Pósa Function for Long Cycles
- On the presence of disjoint subgraphs of a specified type
- Frames, $A$-Paths, and the Erdös--Pósa Property
- Approximation and Kernelization for Chordal Vertex Deletion
- Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen
- Additivity of the genus of a graph
- A new proof and generalizations of a theorem of Erdős and Pósa on graphs withoutk+1 independent circuits
- Chi-boundedness of graph classes excluding wheel vertex-minors
This page was built for publication: Packing and Covering Induced Subdivisions
