𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Coloring graph bundles

✍ Scribed by Sandi Klavžar; Bojan Mohar

Publisher
John Wiley and Sons
Year
1995
Tongue
English
Weight
502 KB
Volume
19
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

Graph bundles generalize the notion of covering graphs and products of graphs. Several results about the chromatic numbers of graph bundles based on the Cartesian product, the strong product and the tensor product are presented. © 1995 John Wiley & Sons, Inc.

📜 SIMILAR VOLUMES

Edge-colorability of graph bundles
Edge-colorability of graph bundles
✍ Tomazˇ Pisanski; John Shawe-Taylor; Jozˇe Vrabec 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 452 KB
Asymmetric graph coloring games
Asymmetric graph coloring games
✍ H. A. Kierstead 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 151 KB

## Abstract We introduce the (__a,b__)‐coloring game, an asymmetric version of the coloring game played by two players Alice and Bob on a finite graph, which differs from the standard version in that, in each turn, Alice colors __a__ vertices and Bob colors __b__ vertices. We also introduce a relat

Coloring graph products — A survey
Coloring graph products — A survey
✍ Sandi Klavẑar 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 564 KB

There are four standard products of graphs: the direct product, the Cartesian product, the strong product and the lexicographic product. The chromatic number turned out to be an interesting parameter on all these products, except on the Cartesian one. A survey is given on the results concerning the