Game Chromatic Number of Generalized Petersen Graphs and Jahangir Graphs
Let G=V,E be a graph, and two players Alice and Bob alternate turns coloring the vertices of the graph G a proper coloring where no two adjacent vertices are signed with the same color. Alice's goal is to color the set of vertices using the minimum number of colors, which is called game chromat...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2020-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2020/6475427 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|