✦ LIBER ✦

Coloring Graphs without Short Non-bounding Cycles

✍ Scribed by S. Fisk; B. Mohar

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 357 KB
Volume: 60
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1994.1018

No coin nor oath required. For personal study only.

✦ Synopsis

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- and four-colorings under additional assumptions on the girth of (G). 1994 Acadermic Press, Inc.

📜 SIMILAR VOLUMES

Planar graph colorings without short mon

Planar graph colorings without short monochromatic cycles

✍ Tomáš Kaiser; Riste Škrekovski 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 126 KB 👁 1 views

## Abstract It is well known that every planar graph __G__ is 2‐colorable in such a way that no 3‐cycle of __G__ is monochromatic. In this paper, we prove that __G__ has a 2‐coloring such that no cycle of length 3 or 4 is monochromatic. The complete graph __K__~5~ does not admit such a coloring. On

Vertex colorings of graphs without short

Vertex colorings of graphs without short odd cycles

✍ Andrzej Dudek; Reshma Ramadurai 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB 👁 1 views

Motivated by the work of Nešetřil and R ödl on "Partitions of vertices" we are interested in obtaining some quantitative extensions of their result. In particular, given a natural number r and a graph G of order m with odd girth g, we show the existence of a graph H with odd girth at least g and ord

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.

Acyclic 5-choosability of planar graphs

Acyclic 5-choosability of planar graphs without adjacent short cycles

✍ O. V. Borodin; A. O. Ivanova 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 93 KB 👁 1 views

The conjecture on acyclic 5-choosability of planar graphs [Borodin et al., 2002] as yet has been verified only for several restricted classes of graphs. None of these classes allows 4-cycles. We prove that a planar graph is acyclically 5-choosable if it does not contain an i-cycle adjacent to a j-cy