𝔖 Bobbio Scriptorium
✦   LIBER   ✦

deBruijn-like sequences and the irregular chromatic number of paths and cycles

✍ Scribed by Michael Ferrara; Christine Lee; Phil Wallis; Ellen Gethner

Book ID
108114157
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
501 KB
Volume
309
Category
Article
ISSN
0012-365X

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,

The number of shortest cycles and the ch
The number of shortest cycles and the chromatic uniqueness of a graph
✍ C. P. Teo; K. M. Koh πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 403 KB πŸ‘ 2 views

## Abstract For a graph __G__, let __g__(__G__) and Οƒ~g~(__G__) denote, respectively, the girth of __G__ and the number of cycles of length __g__(__G__) in __G__. In this paper, we first obtain an upper bound for Οƒ~g~(__G__) and determine the structure of a 2‐connected graph __G__ when Οƒ~g~(__G__)