Planar Graphs of Maximum Degree Seven are Class I

The Four-Colour Theorem

Neil Robertson, Daniel P. Sanders, Paul Seymour et al. · Journal of Combinatorial Theory Series B · 1997 · 608 citations

On total 9-coloring planar graphs of maximum degree seven

Daniel P. Sanders, Yue Zhao · Journal of Graph Theory · 1999 · 84 citations

Natural Sciences, Mathematics, Combinatorics +12

A graph coloring problem

Yu. A. Zuev · Mathematical Notes · 2015 · 26 citations

Natural Sciences, Autonomous Systems, Combinatorics +7

On Improving the Edge-Face Coloring Theorem

Daniel P. Sanders, Yue Zhao · Graphs and Combinatorics · 2001 · 15 citations · Full text

Natural Sciences, Mathematics, Edge Computing +5