Minors in graphs of large \(\theta_r\)-girth
From MaRDI portal
Publication:2400974
DOI10.1016/J.EJC.2017.04.011zbMath1369.05187arXiv1510.03041OpenAlexW2405772563MaRDI QIDQ2400974
Dimitris Chatzidimitriou, Dimitrios M. Thilikos, Ignasi Sau, Jean-Florent Raymond
Publication date: 31 August 2017
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1510.03041
Graph minors (05C83) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (5)
Small complete minors above the extremal edge density ⋮ Packing and covering immersion-expansions of planar sub-cubic graphs ⋮ Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes ⋮ An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\) ⋮ Lean Tree-Cut Decompositions: Obstructions and Algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complete minors in \(K_{s,s}\)-free graphs
- New spectral lower bounds on the bisection width of graphs
- Girth and treewidth
- Lower bound of the Hadwiger number of graphs by their average degree
- Graph minors. V. Excluding a planar graph
- Graph minors. X: Obstructions to tree-decomposition
- Tree-partitions of infinite graphs
- Isomorphism for graphs of bounded distance width
- Highly connected sets and the excluded grid theorem
- Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
- Quickly excluding a planar graph
- On interval routing schemes and treewidth
- On the excluded minors for the matroids of branch-width \(k\)
- The extremal function for complete minors
- On tree-partitions of graphs
- Complete graph minors and the graph minor structure theorem
- The branchwidth of graphs and their cycle matroids
- Topics in Matroid Theory
- Quadratic Upper Bounds on the Erdős-Pósa Property for a Generalization of Packing and Covering Cycles
- Excluded Grid Theorem
- Low Polynomial Exclusion of Planar Graph Patterns
- Minors in random regular graphs
- An extremal function for contractions of graphs
- On Linear Time Minor Tests with Depth-First Search
- Minors in graphs of large girth
- (Meta) Kernelization
- Polynomial bounds for the grid-minor theorem
- A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph
- Large-treewidth graph decompositions and applications
This page was built for publication: Minors in graphs of large \(\theta_r\)-girth
