3 search results - page 1 / 1 » Note on Coloring the Square of an Outerplanar Graph |
ARSCOM
2008
13 years 5 months ago
2008
SODA
2004
ACM
13 years 6 months ago
2004
ACM
We study vertex colorings of the square G2 of an outerplanar graph G. We find the optimal bound of the inductiveness, chromatic number and the clique number of G2 as a function of...
ENDM
2006
13 years 5 months ago
2006
Greedy algorithm sometimes uses more than (G) colors while coloring a graph G. A greedy defining set is an object to eliminate these extra colors so that the greedy coloring resul...