共 50 条
- [1] A LINEAR ALGORITHM FOR COLORING PLANAR GRAPHS WITH 5 COLORS COMPUTER JOURNAL, 1985, 28 (01): : 78 - 81
- [4] COLORING PLANAR GRAPHS IN PARALLEL JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 1987, 8 (04): : 470 - 479
- [8] Randomly Coloring Planar Graphs with Fewer Colors than the Maximum Degree STOC 07: PROCEEDINGS OF THE 39TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, 2007, : 450 - 458
- [10] Three Colors Suffice: Conflict-Free Coloring of Planar Graphs PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2017, : 1951 - 1963