#TITLE_ALTERNATIVE#
Given a graph G and a set of colors {1, 2, ..., k}. Two players alternately color the vertices of G. The first player (A) is aiming that all vertices of G are colored, and the second player (B) is trying to prevent this. The only rule they must obey is to color a vertex with a color different from a...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Subjects: | |
| Online Access: | https://digilib.itb.ac.id/gdl/view/11063 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| id |
id-itb.:11063 |
|---|---|
| spelling |
id-itb.:110632017-09-27T11:43:08Z#TITLE_ALTERNATIVE# HAYATI, NORMA Matematika Indonesia Final Project graph, chromatic number, game chromatic number, Cartesian product graphs. INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/11063 Given a graph G and a set of colors {1, 2, ..., k}. Two players alternately color the vertices of G. The first player (A) is aiming that all vertices of G are colored, and the second player (B) is trying to prevent this. The only rule they must obey is to color a vertex with a color different from all the colors that appeare in its neighborhood (at the time of the coloring). If all the vertices of the graph are colored, A wins, otherwise B wins (that is, at a certain state of the game there appears an uncolored vertex whose neighborhood contains all colors). The smallest k such A has a winning strategy on G using k colors is called the game chromatic number of G. <br /> text |
| institution |
Institut Teknologi Bandung |
| building |
Institut Teknologi Bandung Library |
| continent |
Asia |
| country |
Indonesia Indonesia |
| content_provider |
Institut Teknologi Bandung |
| collection |
Digital ITB |
| language |
Indonesia |
| topic |
Matematika |
| spellingShingle |
Matematika HAYATI, NORMA #TITLE_ALTERNATIVE# |
| description |
Given a graph G and a set of colors {1, 2, ..., k}. Two players alternately color the vertices of G. The first player (A) is aiming that all vertices of G are colored, and the second player (B) is trying to prevent this. The only rule they must obey is to color a vertex with a color different from all the colors that appeare in its neighborhood (at the time of the coloring). If all the vertices of the graph are colored, A wins, otherwise B wins (that is, at a certain state of the game there appears an uncolored vertex whose neighborhood contains all colors). The smallest k such A has a winning strategy on G using k colors is called the game chromatic number of G. <br />
|
| format |
Final Project |
| author |
HAYATI, NORMA |
| author_facet |
HAYATI, NORMA |
| author_sort |
HAYATI, NORMA |
| title |
#TITLE_ALTERNATIVE# |
| title_short |
#TITLE_ALTERNATIVE# |
| title_full |
#TITLE_ALTERNATIVE# |
| title_fullStr |
#TITLE_ALTERNATIVE# |
| title_full_unstemmed |
#TITLE_ALTERNATIVE# |
| title_sort |
#title_alternative# |
| url |
https://digilib.itb.ac.id/gdl/view/11063 |
| _version_ |
1820666041110364160 |