A linear-time algorithm for 7-coloring 1-plane graphs

Algorithmica (New York)

Volumn 43, Issue 3, 2005, Pages 147-177

  Chen, Zhi Zhong ^a   Kouno, Mitsuharu ^a  

^a TOKYO DENKI UNIVERSITY   (Japan)

Author keywords

1 Planar graphs; 1 Plane embeddings; Graph algorithms; NP completeness; Planar graphs; Plane embeddings; Vertex coloring

Indexed keywords

ALGORITHMS; COLOR; PROBLEM SOLVING;

GRAPH ALGORITHMS; LINEAR-TIME ALGORITHM; PLANAR GRAPHS; VERTEX COLORING;

GRAPH THEORY;

EID: 29544452025     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-004-1134-x     Document Type: Article

References (21)

1. K. Appel and W. Haken. Every planar map is four colorable, Part I: Discharging. Illinois J. Math., 21:429-490, 1977.
2. K. Appel, W. Haken, and J. Koch. Every planar map is four colorable, Part II: Reducibility. Illinois J. Math., 21:491-567, 1977.
3. D. Archdeacon. Coupled colorings of planar- graphs. Congr. Numer., 39:89-94, 1983.
4. O.V. Borodin. Solution of Ringel's problems on vertex-face coloring of planar graphs and coloring of 1-planar graphs (in Russian). Melody Diskret. Analiz., 41:12-26, 1984.
5. O.V. Borodin. A new proof of the 6 color theorem. J. Graph Theory, 19:507-521, 1995.
6. Z.-Z. Chen. Approximation algorithms for independent sets in map graphs. J. Algorithms, 41:20-40, 2001.
7. Z.-Z. Chen, M. Grigni, and C.H. Papadimitriou. Planar map graphs. In Proc. ACM STOC '98, pages 514-523, 1998.
8. Z.-Z. Chen, M. Grigni, and C.H. Papadimitriou. Map graphs. J. ACM, 49:127-138, 2002.
9. N. Chiba, T. Nishizeki, and N. Saito. A linear 5-coloring algorithm of planar graphs. J. Algorithms, 8:470-479, 1981.
10. M. Chrobak and K. Diks. Two algorithms for coloring planar graphs with 5 colors. Tech. Report, Columbia University, January, 1987.
11. G.N. Frederickson. On linear-time algorithms for five-coloring planar graphs. Inform. Process. Lett., 19:219-224, 1984.
12. M.R. Garey, D.S. Johnson, and L. Stockmeyer. Some simplified NP-complete graph problems. Theoret. Comput. Sci., 1:237-267, 1976.
13. T. Hagerup, K. Diks, and M. Chrobak. Optimal parallel 5-colouring of planar graphs. SIAM J. Comput., 18:288-300, 1989.
14. J.E. Hopcroft and R.E. Tarjan. Dividing a graph into triconnected components. SIAM J. Comput., 2:135-158, 1973.
15. M. Kouno. A linear-time algorithm for 7-coloring 1-planar graphs. Master's Thesis, Tokyo Denki University, March, 2004.
16. D.W. Matula, Y. Shiloach, and R.E. Tarjan. Two linear-time algorithms for five-coloring a planar graph. Tech. Report STAN-CS-80-830, Stanford University, November, 1980.
17. O. Ore and M.D. Plummer. Cyclic coloration of planar graphs. Recent Progress in Combinatorics (Proc. 3rd Waterloo Conf. on Combinatorics, 1968), Academic Press, New York, pages 287-293, 1969.
18. G. Ringel. Ein Sechsfarbenproblem auf der Kugel. Abh. Math. Sem. Univ. Hamburg, 29:107-117, 1965.
19. R.E. Tarjan. Depth-first search and linear graph algorithms. SIAM J. Comput., 1:146-160, 1972.
20. W.T. Tutte. Connectivity in Graphs. University of Toronto Press, Toronto, 1966.
21. M.H. Williams. A linear algorithm for colouring planar graphs with five colours. Comput. J., 28:78-81, 1985.