Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

24

DM
2008

favoriteEmaildiscussreport

91views more DM 2008»

Lower bounds for the game colouring number of partial k-trees and planar graphs

13 years 11 months ago

Lower bounds for the game colouring number of partial k-trees and planar graphs

Download www.math.nsysu.edu.tw

This paper discusses the game colouring number of partial k-trees and planar graphs. Let colg(PT k) and colg(P) denote the maximum game colouring number of partial k trees and the maximum game colouring number of planar graphs, respectively. In this paper, we prove that

Jiaojiao Wu, Xuding Zhu

Real-time Traffic

DM 2008 | Game | Maximum Game | Partial K-trees |

claim paper

Related Content

» An adjacency lemma for critical multigraphs

» Graph Treewidth and Geometric Thickness Parameters

» On degrees in random triangulations of point sets

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	DM
Authors	Jiaojiao Wu, Xuding Zhu

Comments (0)