On the game chromatic number of cartesian product of graphs
The game chromatic number refers to the smallest integer k such that the first player Alice is assumed of a victory in the coloring game variety wherein Alice and Bob take turns in coloring vertices of a graph, with the only rule that adjacent vertices cannot have the same color. Alice wins if all v...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Animo Repository
2010
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/11497 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Language: | English |