Sciweavers

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

31

IPL
2010

favoriteEmaildiscussreport

91views more IPL 2010»

Total coloring of planar graphs of maximum degree eight

13 years 9 months ago

Total coloring of planar graphs of maximum degree eight

Download www.ncts.ncku.edu.tw

Nicolas Roussel, Xuding Zhu

Real-time Traffic

IPL 2010 |

claim paper

Related Content

» Randomly coloring planar graphs with fewer colors than the maximum degree

» Total chromatic number of planar graphs with maximum degree ten

» New LinearTime Algorithms for EdgeColoring Planar Graphs

» Coloring squares of planar graphs with girth six

» On the Algorithmic Complexity of Twelve Covering and Independence Parameters of Graphs

» Coloring powers of planar graphs

» Graph Subcolorings Complexity and Algorithms

» Weighted Coloring on Planar Bipartite and Split Graphs Complexity and Improved Approximati...

» Injective colorings of sparse graphs

Post Info
More Details (n/a)

Added	28 Jan 2011
Updated	28 Jan 2011
Type	Journal
Year	2010
Where	IPL
Authors	Nicolas Roussel, Xuding Zhu

Comments (0)