✦ LIBER ✦

Tough Ramsey Graphs Without Short Cycles

✍ Scribed by Noga Alon

Book ID: 110420202
Publisher: Springer
Year: 1995
Tongue: English
Weight: 385 KB
Volume: 4
Category: Article
ISSN: 0925-9899
DOI: 10.1023/a:1022453926717

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Longest cycles in tough graphs

✍ Jung, H.A.; Wittmann, P. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 347 KB 👁 2 views

In this article, we establish bounds for the length of a longest cycle C in a 2-connected graph G in terms of the minimum degree δ and the toughness t. It is shown that C is a Hamiltonian cycle or |C| ≥ (t + 1)δ + t.

Choosability of toroidal graphs without

Choosability of toroidal graphs without short cycles

✍ Leizhen Cai; Weifan Wang; Xuding Zhu 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 142 KB 👁 1 views

## Abstract Let __G__ be a toroidal graph without cycles of a fixed length __k__, and χ~__l__~(__G__) the list chromatic number of __G__. We establish tight upper bounds of χ~__l__~(__G__) for the following values of __k__: © 2009 Wiley Periodicals, Inc. J Graph Theory 65: 1–15, 2010.

Coloring Graphs without Short Non-boundi

Coloring Graphs without Short Non-bounding Cycles

✍ S. Fisk; B. Mohar 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 357 KB

It is shown that there is a constant \(c\) such that if \(G\) is a graph embedded in a surface of genus \(g\) (either orientable or non-orientable) and the length of a shortest non-bounding cycle of \(G\) is at least \(c \log (g+1)\), then \(G\) is six-colorable. A similar result holds for three- an

Hamiltonian cycles in 1-tough graphs

✍ Bing Wei 📂 Article 📅 1996 🏛 Springer Japan 🌐 English ⚖ 710 KB

On 3-colorable planar graphs without sho

On 3-colorable planar graphs without short cycles

✍ Min Chen; Weifan Wang 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 198 KB

Graphs without short odd cycles are near

Graphs without short odd cycles are nearly bipartite

✍ Ervin Györi; Alexandr V Kostochka; Tomasz Łuczak 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 230 KB

It is proved that for every constant ~ > 0 and every graph G on n vertices which contains no odd cycles of length smaller than ~n, G can be made bipartite by removing (15/~}ln(10/~)) vertices. This resuIt is best possible except for a constant factor. Moreover, it is shown that one can destroy all o