Sciweavers

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

112

COLOGNETWENTE
2008

87views Optimization» more COLOGNETWENTE 2008»

A decomposition for total-coloring graphs of maximum degree 3

15 years 4 months ago

A decomposition for total-coloring graphs of maximum degree 3

Download ctw08.dti.unimi.it

Raphael Machado, Celina M. Herrera de Figueiredo

Real-time Traffic

COLOGNETWENTE 2008 | Optimization |

claim paper

Related Content

» Total coloring of planar graphs of maximum degree eight

» All graphs with maximum degree three whose complements have 4cycle decompositions

» On incidence coloring for some cubic graphs

» Combinatorial 56approximation of Max Cut in graphs of maximum degree 3

» 4edgecoloring graphs of maximum degree 3 in linear time

» Subexponential parameterized algorithms for degreeconstrained subgraph problems on planar ...

» PTAS for maximum weight independent set problem with random weights in bounded degree grap...

» Large induced subgraphs with equated maximum degree

» The Domatic Number of Regular Graphs

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2008
Where	COLOGNETWENTE
Authors	Raphael Machado, Celina M. Herrera de Figueiredo

Comments (0)