Outerplanar Graph With an uncooperative Partner
碩士 === 國立屏東教育大學 === 應用數學系 === 98 === The game chromatic number of a graph is introduced by Bodlaender, where the game chromatic number of a tree is discussed, and we known that the game chromatic number of a tree is at most 4. It is figured out that the game chromatic number of a planar graph is bou...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2010
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/10497854056060118156 |
| Summary: | 碩士 === 國立屏東教育大學 === 應用數學系 === 98 === The game chromatic number of a graph is introduced by Bodlaender, where the game chromatic number of a tree is discussed, and we known that the game chromatic number of a tree is at most 4. It is figured out that the game chromatic number of a planar graph is bounded.
In this paper, we want to study the game chromatic number of the outerplanar graph. It is known that every outerplanar graph G has at most 7 by Xuding Zhu. We construct some outerplanar graphs with game chromatic number 6 or 7, and analyse their structures and properties.
|
|---|