Minors in graphs of large girth
From MaRDI portal
Publication:4800396
DOI10.1002/RSA.10076zbMATH Open1015.05085OpenAlexW2166849071MaRDI QIDQ4800396FDOQ4800396
Authors: Daniela Kühn, Deryk Osthus 
Publication date: 3 April 2003
Published in: Random Structures \& Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.10076
Recommendations
- Minors in graphs of large \(\theta_r\)-girth
- Topological minors in graphs of large girth
- Dense minors in graphs of large girth
- Large minors in graphs with given independence number
- Graph minor theory
- scientific article; zbMATH DE number 3906520
- Minors in large almost-5-connected non-planar graphs
- Graph minors: generalizing Kuratowski's theorem
- Minors in expanding graphs
- Minors in Graphs with High Chromatic Number
Cites Work
- The extremal function for complete minors
- Homomorphiesätze für Graphen
- An extremal function for contractions of graphs
- Lower bound of the Hadwiger number of graphs by their average degree
- Minimal Regular Graphs of Girths Eight and Twelve
- \(C_ 6\)-free bipartite graphs and product representation of squares
- On Hamiltonian Regular Graphs of Girth Six
- Topological subgraphs in graphs of large girth
- Girth in graphs
- The sextet construction for cubic graphs
- Girths of bipartite sextet graphs
- Topological minors in graphs of large girth
- Subdivisions of a graph of maximal degree \(n+1\) in graphs of average degree \(n+\epsilon\) and large girth
Cited In (28)
- Unavoidable vertex-minors in large prime graphs
- A note on graphs with large girth and small minus domination number
- Breaking the degeneracy barrier for coloring graphs with no \(K_t\) minor
- Graph theory. Abstracts from the workshop held January 2--8, 2022
- On the Hadwiger's conjecture for graph products
- Complete minors in \(K_{s,s}\)-free graphs
- Hadwiger number and the Cartesian product of graphs
- Finding and using expanders in locally sparse graphs
- Small minors in dense graphs
- Some recent progress and applications in graph minor theory
- Dense minors in graphs of large girth
- Tight bounds for divisible subdivisions
- Strong chromatic index and Hadwiger number
- Recent progress towards Hadwiger's conjecture
- Minor-equivalence for infinite graphs
- Complete Minors in Graphs Without Sparse Cuts
- Minors in Graphs with High Chromatic Number
- On the connectivity of diamond-free graphs
- High-girth graphs avoiding a minor are nearly bipartite
- Unavoidable minors for graphs with large \(\ell_p\)-dimension
- Erdős-Pósa from ball packing
- Girth and treewidth
- Graph minor theory
- On the number of edges in a \(K_5\)-minor-free graph of given girth
- Properties of 8-contraction-critical graphs with no \(K_7\) minor
- Topological minors in graphs of large girth
- Minors in graphs of large \(\theta_r\)-girth
- Structure and colour in triangle-free graphs
This page was built for publication: Minors in graphs of large girth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4800396)
