Topological Minors in Graphs of Large Girth
Authors:
- Daniela KühnDKDaniela Kühn
- Deryk OsthusDODeryk Osthus
- 1 November 2002
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 86 (2) , 364-380
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Subdivisions of a Graph of Maximal Degree n + 1 in Graphs of Average Degree $n+epsilon$ and Large GirthCombinatorica, 2001
- An extremal problem for subdivisions ofK?5Journal of Graph Theory, 1999
- Proof of a Conjecture of Mader, Erdös and Hajnal on Topological Complete SubgraphsEuropean Journal of Combinatorics, 1998
- Topological Subgraphs in Graphs of Large GirthCombinatorica, 1998
- Highly linked graphsCombinatorica, 1996
- Topological cliques in graphs IICombinatorics, Probability and Computing, 1996
- On the conjecture of hajósCombinatorica, 1981
- Hajós' graph-coloring conjecture: Variations and counterexamplesJournal of Combinatorial Theory, Series B, 1979
- Eine Verallgemeinerung desn-fachen Zusammenhangs f r GraphenMathematische Annalen, 1970