𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Chromatic numbers of the strong product of odd cycles

✍ Scribed by Janez Z̆erovnik

Book ID
104444170
Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
220 KB
Volume
11
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The independence number of the strong pr
The independence number of the strong product of odd cycles
✍ Aleksander Vesel; Janez Ẑerovnik 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 209 KB

The independence number of the strong product C5~]C7[]C7 determined by the NISPOC software package is presented. Better lower bounds on the independence numbers for two infinite families of strong products of three odd cycles are given.

The chromatic Ramsey number of odd wheel
The chromatic Ramsey number of odd wheels
✍ Nathalie Paul; Claude Tardif 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 110 KB

We prove that the chromatic Ramsey number of every odd wheel W 2k+1 , k ≥ 2 is 14. That is, for every odd wheel W 2k+1 , there exists a 14-chromatic graph F such that when the edges of F are two-coloured, there is a monochromatic copy of W 2k+1 in F, and no graph F with chromatic number 13 has the s

The chromatic numbers of graph bundles o
The chromatic numbers of graph bundles over cycles
✍ Sandi Klavẑar; Bojan Mohar 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 565 KB

Graph bundles generalize the notion of covering graphs and products of graphs. The chromatic numbers of product bundles with respect to the Cartesian, strong and tensor product whose base and fiber are cycles are determined. ## 1. Introduction If G is a graph, V(G) and E(G) denote its vertex and e

A bound on the chromatic number using th
A bound on the chromatic number using the longest odd cycle length
✍ Sreyash Kenkre; Sundar Vishwanathan 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 120 KB 👁 1 views

## Abstract Let __G__ be a non‐bipartite graph with ℓ as the length of the longest odd cycle. Erdös and Hajnal proved that χ(__G__) ≤ ℓ + 1. We show that the only graphs for which this is tight are those that contain __K__~ℓ~ + 1 and further, if __G__ does not contain __K__~ℓ~ then χ(__G__) ≤ ℓ −1.

The independence number of the strong pr
The independence number of the strong product of cycles
✍ A. Vesel 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 779 KB

We describe algorithms to search independent vertex sets in strong products of odd cycles. The algorithms enable determination of the independence number of two infinite families of graphs: C5 [] C7 [] C2k+i and C5 [] C9 [] C2k+i. We also present exact values or improved bounds on the size of a larg