𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On odd circuits in chromatic graphs

✍ Scribed by W. G. Brown; H. A. Jung


Publisher
Akadmiai Kiad
Year
1969
Tongue
English
Weight
367 KB
Volume
20
Category
Article
ISSN
1588-2632

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


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

Packing Odd Circuits in Eulerian Graphs
✍ James F. Geelen; Bertrand Guenin πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 179 KB

Let C be the clutter of odd circuits of a signed graph ðG; SÞ: For nonnegative integral edge-weights w; we are interested in the linear program minðw t x: xðCÞ51; for C 2 C; and x50Þ; which we denote by (P). The problem of solving the related integer program clearly contains the maximum cut problem,

4-chromatic graphs with large odd girth
✍ Nguyen Van Ngoc; Zsolt Tuza πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 251 KB

It is known that the Mycielski graph can be generalized to obtain an infinite family of 4-chromatic graphs with no short odd cycles. The first proof of this result, due to Stiebitz, applied the topological method of Lov~sz. The proof presented here is elementary combinatorial.

On chromatic-choosable graphs
✍ Kyoji Ohba πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 70 KB

## Abstract A graph is chromatic‐choosable if its choice number coincides with its chromatic number. It is shown in this article that, for any graph __G__, if we join a sufficiently large complete graph to __G__, then we obtain a chromatic‐choosable graph. As a consequence, if the chromatic number