New Linear-Time Algorithms for Edge-Coloring Planar Graphs

  title={New Linear-Time Algorithms for Edge-Coloring Planar Graphs},
  author={Richard J. Cole and Lukasz Kowalik},
Abstract We show efficient algorithms for edge-coloring planar graphs. Our main result is a linear-time algorithm for coloring planar graphs with maximum degree Δ with max {Δ,9} colors. Thus the coloring is optimal for graphs with maximum degree Δ≥9. Moreover for Δ=4,5,6 we give linear-time algorithms that use Δ+2 colors. These results improve over the algorithms of Chrobak and Yung (J. Algorithms 10:35–51, 1989) and of Chrobak and Nishizeki (J. Algorithms 11:102–116, 1990) which color planar… Expand
Extended Online Graph Edge Coloring
This paper improves the online algorithm for edge coloring, inspired by a distributed offline algorithm of Panconesi and Srinivasan, referred as PS algorithm, which works on 2-rounds and extends by reusing colors online in multiple rounds. Expand
Coloring outerplanar graphs and planar 3-trees with small monochromatic components
This work focuses on colorings with two and three available colors and presents improved bounds on the size of the monochromatic connected components for two meaningful subclasses of planar graphs, namely maximal outerplanar graphs and complete planar 3- trees. Expand
A Planar linear arboricity conjecture
It is shown that for planar graphs, this equality is true for any even Δ⩾10, leaving open only the cases Δ = 6, 8, 8. Expand
A Planar LAC
The linear arboricity la(G) of a graph G is the minimum number of linear forests (graphs where every connected component is a path) that partition the edges of G. In 1984, Akiyama et al. [MathExpand
Fractional Edge and Total Colouring
Many problems which seek to schedule, sequence, or time-table a set of events subject to given constraints can be modelled as graph colouring problems. In this thesis, we study the edge and totalExpand
Optimal Online Edge Coloring of Planar Graphs with Advice
This work studies the amount of knowledge about the future that an online algorithm needs to color the edges of a graph optimally, i.e., using as few colors as possible, and shows that for bipartite graphs, any such algorithm must use at least $$\Omega m\log \Delta $$ bits of advice to achieve optimality. Expand
A Generalization of Kotzig's Theorem and Its Application
This work describes a linear-time algorithm for efficient choosability of planar graphs with maximum degree Delta, and proves a similar result with 2-alternating cycles and 3-alternators replaced by five fixed bounded-sized configurations called crowns. Expand
Distributed Graph Coloring: Fundamentals and Recent Developments
The objective of this monograph is to provide a treatise on theoretical foundations of distributed symmetry breaking in the message-passing model of distributed computing and to stimulate further progress in this exciting area. Expand
The linear arboricity conjecture for 3-degenerate graphs
The proof yields an $O(n)$-time algorithm that partitions the edge set of any 3-degenerate graph G on $n$ vertices into at most $\left\lceil\frac{\Delta(G)+1}{2}\right\rceil$ linear forests. Expand
A Planar Linear Arboricity Conjecture
It is shown that for planar graphs this equality is true for any Δ≥10, leaving open only the cases Δ=6, 8, 8. Expand


Fast Algorithms for Edge-Coloring Planar Graphs
Two algorithms which color edges of every planar graph G with max(Δ(G, 19) colors) produce an optimal coloring if Δ(G) ≥ 19, and both improve the best known sequential and parallel algorithms. Expand
Improved Edge-Coloring Algorithms for Planar Graphs
Two algorithms which find such a coloring when Δ ≥ 9 are presented, one of which is a sequential O(n log n) time algorithm and the other is a parallel EREW PRAM algorithm which works in time O(log3n) and uses O( n) processors. Expand
An Efficient Algorithm for Edge Coloring Planar Graphs with Delta Colors
  • Xin He
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 1990
An efficient algorithm for edge coloring a planar graph G is presented that takes O (log 2 n ) time with O( n ) processors to construct an edge coloring of G using Δ colors. Expand
A simple algorithm for edge-coloring bipartite multigraphs
  • N. Alon
  • Mathematics, Computer Science
  • Inf. Process. Lett.
  • 2003
A new, simpler algorithm for finding a proper k-edge-coloring of any bipartite multigraph G with n vertices and m edges is described, that runs in time O(m logm) as well. Expand
On the total coloring of planar graphs.
The total coloring of a graph G is a coloring of its vertices and edges in which any two adjacent or incident elements of F(G)u£(G) are colored with different colors. Behzad [1] and Vizing [9]Expand
Edge-Coloring Bipartite Multigraphs in O(E logD) Time
It is shown that a minimal edge-coloring of G can be computed in O(E logD time), which follows from an algorithm for finding a matching in a regular bipartite graph in O (E) time. Expand
4-edge-coloring Graphs of Maximum Degree 3 in Linear Time
A linear time algorithm is presented to properly color the edges of any graph of maximum degree 3 using 4 colors using a greedy approach and utilizes a new structure theorem for such graphs. Expand
Efficiently four-coloring planar graphs
An outline of aquadratic algorithm to 4-color planar graphs is presented, based upon anew proof of the Four Color Theorem. This algorithm improves aquartic algorithm of Appel and Haken.
Planar Graphs of Maximum Degree Seven are Class I
The maximum degree seven case is proved, which proves that planar graphs of maximum degree at least eight have the edge chromatic number equal to their maximum degree. Expand
4. On the Colouring of Maps.
Some years ago, while I was still working at knots, Professor Cayley told me of De Morgan's statement that four colours had been found by experience to be sufficient for the purpose of completelyExpand