𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Conditional chromatic numbers with forbidden cycles

✍ Scribed by Karen Casey Dargen; Kathryn Fraughnaugh

Book ID
107826664
Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
966 KB
Volume
217
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Induced Cycles and Chromatic Number
Induced Cycles and Chromatic Number
✍ A.D. Scott πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 87 KB

We prove that, for any pair of integers k, l 1, there exists an integer N(k, l ) such that every graph with chromatic number at least N(k, l ) contains either K k or an induced odd cycle of length at least 5 or an induced cycle of length at least l.