Sciweavers

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

100

IPL
2002

79views more IPL 2002»

4-edge-coloring graphs of maximum degree 3 in linear time

15 years 2 months ago

4-edge-coloring graphs of maximum degree 3 in linear time

Download www.cs.colorado.edu

San Skulrattanakulchai

Real-time Traffic

IPL 2002 |

claim paper

Related Content

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

» Graph Subcolorings Complexity and Algorithms

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

» New LinearTime Algorithms for EdgeColoring Planar Graphs

» Partitions and Coverings of Trees by BoundedDegree Subtrees

» Optimal faulttolerant linear arrays

» Graph Inference from a Walk for TRees of Bounded Degree 3 is NPComplete

» A Lower Bound for Testing 3Colorability in BoundedDegree Graphs

» Fault tolerant networks with small degree

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	2002
Where	IPL
Authors	San Skulrattanakulchai

Comments (0)