A Linear-Time Algorithm for 7-Coloring 1-Planar Graphs
A graph G is 1-planar if it can be embedded in the plane in such a way that each edge crosses at most one other edge. Borodin showed that 1-planar graphs are 6-colorable, but his proof only leads to a complicated polynomial (but nonlinear) time algorithm. This paper presents a linear-time algorithm for 7-coloring 1-planar graphs (that are already embedded in the plane). The main difficulty in the design of our algorithm comes from the fact that the class of 1-planar graphs is not closed under the operation of edge contraction. This difficulty is overcome by a structure lemma that may find useful in other problems on 1-planar graphs. This paper also shows that it is NP-complete to decide whether a given 1-planar graph is 4-colorable. The complexity of the problem of deciding whether a given 1-planar graph is 5-colorable is still unknown.
KeywordsEdge Contraction Critical Edge Small Vertex Distinct Neighbor Critical Vertex
Unable to display preview. Download preview PDF.
- 7.Chen, Z.-Z., Grigni, M., Papadimitriou, C.H.: Planar map graphs. In: Proc. ACM STOC 1998, pp. 514–523 (1998)Google Scholar
- 10.Chrobak, M., Diks, K.: Two algorithms for coloring planar graphs with 5 colors. Tech. Report, Columbia University (January 1987) Google Scholar
- 12.Matula, D.W., Shiloach, Y., Tarjan, R.E.: Two linear-time algorithms for fivecoloring a planar graph. Tech. Report STAN-CS-80-830, Stanford University (November 1980) Google Scholar
- 13.Ore, O., Plummer, M.D.: Cyclic coloration of planar graphs. In: Recent Progress in Combinatorics (Proc. 3rd Waterloo Conf. on Combinatorics, 1968), pp. 287–293. Academic Press, New York (1969)Google Scholar