𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results

✍ Scribed by Christine T. Cheng

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

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A note on the line-distinguishing chroma
A note on the line-distinguishing chromatic number and the chromatic index of a graph
✍ N. Zagaglia Salvi πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 126 KB πŸ‘ 1 views

## Abstract Let Ξ»(__G__) be the line‐distinguishing chromatic number and __x__β€²(__G__) the chromatic index of a graph __G__. We prove the relation Ξ»(__G__) β‰₯ __x__β€²(__G__), conjectured by Harary and Plantholt. Β© 1993 John Wiley & Sons, Inc.

On the chromatic number of multiple inte
On the chromatic number of multiple interval graphs and overlap graphs
✍ A. GyΓ‘rfΓ‘s πŸ“‚ Article πŸ“… 1985 πŸ› Elsevier Science 🌐 English βš– 374 KB

Let x(G) and o(G) denote the chromatic number and clique number of a graph G. We prove that x can be bounded by a function of o for two well-known relatives of interval graphs. Multiple interval graphs (the intersection graphs of sets which can be written as the union of t closed intervals of a line