Linear Time Coloring of Planar Graphs.
暂无分享,去创建一个
Abstract : It is shown how to color a planar with 5-colors in linear time. The batching method used may have additional applications to other graph theory problems. (Author)
[1] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[2] Larry Stockmeyer,et al. Planar 3-colorability is polynomial complete , 1973, SIGA.
[3] O. Ore. The Four-Color Problem , 1967 .