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

Authors:
San Skulrattanakulchai
Affiliations:
Department of Computer Science, University of Colorado at Boulder, Boulder, CO
Venue:
Information Processing Letters
Year:
2002

Citing 2
Cited 5

Cubic graphs

ACM Computing Surveys (CSUR)
Path-based depth-first search for strong and biconnected components

Information Processing Letters

Delta-List Vertex Coloring in Linear Time

SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Coloring Algorithms on Subcubic Graphs

COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Cutting cycles of rods in space: hardness and approximation

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Topology control for future airborne networks

MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Drawing graphs with vertices at specified positions and crossings at large angles

WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation

Quantified Score

Hi-index	0.89

Visualization

Abstract

We present a linear time algorithm to properly color the edges of any graph of maximum degree 3 using 4 colors. Our algorithm uses a greedy approach and utilizes a new structure theorem for such graphs.