Title
Note On Coloring The Square Of An Outerplanar Graph
Abstract
A new proof is given to the following result of ours. Let G be an outerplanar graph with maximum degree Delta >= 3. The chromatic number chi(G(2)) of the square of G is at most Delta + 2,and chi(G(2)) = Delta + 1 if Delta >= 7.
Year
Venue
Keywords
2008
ARS COMBINATORIA
outerplanar graph
Field
DocType
Volume
Discrete mathematics,Edge coloring,Outerplanar graph,Combinatorics,Fractional coloring,Graph power,Cubic graph,List coloring,1-planar graph,Mathematics,Graph coloring
Journal
86
ISSN
Citations 
PageRank 
0381-7032
0
0.34
References 
Authors
0
2
Name
Order
Citations
PageRank
Weifan Wang186889.92
Ko-wei Lih252958.80