𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Small odd cycles in 4-chromatic graphs

✍ Scribed by Tao Jiang

Publisher
John Wiley and Sons
Year
2001
Tongue
English
Weight
50 KB
Volume
37
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

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

📜 SIMILAR VOLUMES

Short odd cycles in 4-chromatic graphs
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.

On hamiltonian cycles in the prism over
On hamiltonian cycles in the prism over the odd graphs
✍ Letícia R. Bueno; Peter Horák 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 137 KB 👁 2 views

The Kneser graph K (n, k) has as its vertex set all k-subsets of an n-set and two k-subsets are adjacent if they are disjoint. The odd graph O k is a special case of Kneser graph when n = 2k +1. A long standing conjecture claims that O k is hamiltonian for all k>2. We show that the prism over O k is

K4-free graphs with no odd hole: Even pa
K4-free graphs with no odd hole: Even pairs and the circular chromatic number
✍ Yori Zwols 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 219 KB

An odd hole in a graph is an induced cycle of odd length at least five. In this article we show that every imperfect K 4 -free graph with no odd hole either is one of two basic graphs, or has an even pair or a clique cutset. We use this result to show that every K 4 -free graph with no odd hole has

Uniqueness of maximal dominating cycles
Uniqueness of maximal dominating cycles in 3-regular graphs and of hamiltonian cycles in 4-regular graphs
✍ Herbert Fleischner 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 461 KB 👁 2 views

## Abstract We construct 3‐regular (cubic) graphs __G__ that have a dominating cycle __C__ such that no other cycle __C__~1~ of __G__ satisfies __V(C)__ ⊆ __V__(__C__~1~). By a similar construction we obtain loopless 4‐regular graphs having precisely one hamiltonian cycle. The basis for these const

Hourglasses and Hamilton cycles in 4-con
Hourglasses and Hamilton cycles in 4-connected claw-free graphs
✍ Tomáš Kaiser; MingChu Li; Zdeněk Ryjáček; Liming Xiong 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 97 KB 👁 2 views

## Abstract We show that if __G__ is a 4‐connected claw‐free graph in which every induced hourglass subgraph __S__ contains two non‐adjacent vertices with a common neighbor outside __S__, then __G__ is hamiltonian. This extends the fact that 4‐connected claw‐free, hourglass‐free graphs are hamilton

On the number of cycles of length 4 in a
On the number of cycles of length 4 in a maximal planar graph
✍ Ahmad Fawzi Alameddine 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 148 KB 👁 2 views

## Abstract Let __p__ and __C__~4~ (__G__) be the number of vertices and the number of 4‐cycles of a maximal planar graph __G__, respectively. Hakimi and Schmeichel characterized those graphs __G__ for which __C__~4~ (__G__) = 1/2(__p__^2^ + 3__p__ ‐ 22). This characterization is correct if __p__ ≥