✦ LIBER ✦

Counting odd cycles in locally dense graphs

✍ Scribed by Reiher, Christian

Book ID: 122159656
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 204 KB
Volume: 105
Category: Article
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2013.12.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximately Counting Hamilton Paths an

Approximately Counting Hamilton Paths and Cycles in Dense Graphs

✍ Dyer, Martin; Frieze, Alan; Jerrum, Mark 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 265 KB

Even Cycles in Graphs with Many Odd Cycl

Even Cycles in Graphs with Many Odd Cycles

✍ Ralph J. Faudree; Evelyne Flandrin; Michael S. Jacobson; Jenő Lehel; Richard H. 📂 Article 📅 2000 🏛 Springer Japan 🌐 English ⚖ 133 KB

Edge-disjoint odd cycles in planar graph

Edge-disjoint odd cycles in planar graphs

✍ Daniel Král’; Heinz-Jürgen Voss 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 277 KB

Short odd cycles in 4-chromatic graphs

✍ Nilli, A. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 163 KB 👁 3 views

It is shown that any 4-chromatic graph on n vertices contains an odd cycle of length smaller than √ 8n.

Small odd cycles in 4-chromatic graphs

✍ Tao Jiang 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 50 KB

## Abstract It is shown that every 4‐chromatic graph on __n__ vertices contains an odd cycle of length less than $2\sqrt {n}\,+3$. This improves the previous bound given by Nilli [J Graph Theory 3 (1999), 145–147]. © 2001 John Wiley & Sons, Inc. J Graph Theory 37: 115–117, 2001

Induced packing of odd cycles in planar

Induced packing of odd cycles in planar graphs

✍ Petr A. Golovach; Marcin Kamiński; Daniël Paulusma; Dimitrios M. Thilikos 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 286 KB