𝔖 Bobbio Scriptorium
✦   LIBER   ✦

-chromatic numbers of powers of paths and cycles

✍ Scribed by Lin, Wu-Hsiung; Chang, Gerard J.

Book ID
122484200
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
407 KB
Volume
161
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The mean chromatic number of paths and c
The mean chromatic number of paths and cycles
✍ Martin Anthony; Norman Biggs πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 245 KB

The mean chromatic number of a graph is defined. This is a measure of the expected performance of the greedy vertex-colouring algorithm when each ordering of the vertices is equally likely. In this note, we analyse the asymptotic behaviour of the mean chromatic number for the paths and even cycles,

Path chromatic numbers of graphs
Path chromatic numbers of graphs
✍ Jin Akiyama; Hiroshi Era; Severino V. Gervacio; Mamoru Watanabe πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 112 KB
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