✦ LIBER ✦

Dense Minors In Graphs Of Large Girth

✍ Scribed by Reinhard Diestel; Christof Rempel

Publisher: Springer-Verlag
Year: 2004
Tongue: English
Weight: 153 KB
Volume: 25
Category: Article
ISSN: 0209-9683
DOI: 10.1007/s00493-005-0009-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Topological Minors in Graphs of Large Gi

Topological Minors in Graphs of Large Girth

✍ Daniela Kühn; Deryk Osthus 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 204 KB

We prove that every graph of minimum degree at least r and girth at least 186 contains a subdivision of K rþ1 and that for r5435 a girth of at least 15 suffices. This implies that the conjecture of Haj ! o os that every graph of chromatic number at least r contains a subdivision of K r (which is fal

Edges in graphs with large girth

✍ R. D. Dutton; R. C. Brigham 📂 Article 📅 1991 🏛 Springer Japan 🌐 English ⚖ 365 KB

Topological Subgraphs in Graphs of Large

Topological Subgraphs in Graphs of Large Girth

✍ W. Mader 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 182 KB

Extraconnectivity of graphs with large g

Extraconnectivity of graphs with large girth

✍ J. Fàbrega; M.A. Fiol 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 547 KB

Computing independent sets in graphs wit

Computing independent sets in graphs with large girth

✍ Owen J. Murphy 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 377 KB

Cops and robbers in graphs with large gi

Cops and robbers in graphs with large girth and Cayley graphs

✍ Peter Frankl 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 243 KB