A linear 5-coloring algorithm of planar graphs |
| |
| Authors: | Norishige Chiba Takao Nishizeki Nobuji Saito |
| |
| Affiliation: | Department of Electrical Communications, Faculty of Engineering, Tohoku University, Sendai 980, Japan |
| |
| Abstract: | A simple linear algorithm is presented for coloring planar graphs with at most five colors. The algorithm employs a recursive reduction of a graph involving the deletion of a vertex of degree 6 or less possibly together with the identification of its several neighbors. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
