𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Colourings of the cartesian product of graphs and multiplicative Sidon sets

✍ Scribed by Attila Pór; David R. Wood

Publisher
Springer-Verlag
Year
2009
Tongue
English
Weight
551 KB
Volume
29
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Counting stable sets on Cartesian produc
Counting stable sets on Cartesian products of graphs
✍ Florence Forbes; Bernard Ycart 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 552 KB

We study the generating functions for the number of stable sets of all cardinalities, in the case of graphs which are Cartesian products by paths, cycles, or trees. Explicit results are given for products by cliques. Algorithms based on matrix products are derived for grids, cylinders, toruses and h

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