𝔖 Bobbio Scriptorium
✦   LIBER   ✦

b-colouring the Cartesian product of trees and some other graphs

✍ Scribed by Maffray, Frédéric; Silva, Ana

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

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The binding numbers of some Cartesian pr
The binding numbers of some Cartesian products of graphs
✍ Danuta Michalak 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 238 KB

In the paper we obtain some conditions under which the binding number bind (C) of a Cartesian product graph G is equal to The concept of the binding number of a graph was introduced by Woodall in 1973 . The main theorem of Woodall's paper is a sufficient condition for the existence of a Hamiltonian

Game coloring the Cartesian product of g
Game coloring the Cartesian product of graphs
✍ Xuding Zhu 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 186 KB

## Abstract This article proves the following result: Let __G__ and __G__′ be graphs of orders __n__ and __n__′, respectively. Let __G__^\*^ be obtained from __G__ by adding to each vertex a set of __n__′ degree 1 neighbors. If __G__^\*^ has game coloring number __m__ and __G__′ has acyclic chromat