Topological minors in graphs of large girth
From MaRDI portal
Publication:1403927
DOI10.1006/jctb.2002.2133zbMath1026.05063OpenAlexW1989612647MaRDI QIDQ1403927
Publication date: 20 August 2003
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.2002.2133
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (14)
Minors in graphs of large girth ⋮ Some recent progress and applications in graph minor theory ⋮ Linking four vertices in graphs of large connectivity ⋮ 4‐Separations in Hajós graphs ⋮ Rainbow clique subdivisions ⋮ Balanced Subdivisions of a Large Clique in Graphs with High Average Degree ⋮ Topological minors in bipartite graphs ⋮ Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz ⋮ Hajós' conjecture and cycle power graphs ⋮ Girth and treewidth ⋮ Some remarks on Hajós' conjecture ⋮ Reducing Hajós' 4-coloring conjecture to 4-connected graphs ⋮ The Kelmans-Seymour conjecture. IV: A proof ⋮ Subdivisions of a large clique in \(C_6\)-free graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Hajos' graph-coloring conjecture: Variations and counterexamples
- Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs
- Topological subgraphs in graphs of large girth
- On the conjecture of Hajos
- Eine Verallgemeinerung des \(n\)-fachen Zusammenhangs für Graphen
- Highly linked graphs
- An extremal problem for subdivisions ofK?5
- K-linked graphs with girth condition
- Large Topological Cliques in Graphs Without a 4-Cycle
- Topological cliques in graphs II
- 25 pretty graph colouring problems
- Subdivisions of a graph of maximal degree \(n+1\) in graphs of average degree \(n+\epsilon\) and large girth
This page was built for publication: Topological minors in graphs of large girth
