O(n log n) algorithm for edge-coloring planar graphs with Delta >= 8 using Delta colors, extending prior O(n log n) result for Delta >= 9 and generalizing to bounded-genus graphs.
Even faster (∆ + 1)-edge coloring via shorter multi-step vizing chains
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The planar edge-coloring theorem of Vizing in $O(n\log n)$ time
O(n log n) algorithm for edge-coloring planar graphs with Delta >= 8 using Delta colors, extending prior O(n log n) result for Delta >= 9 and generalizing to bounded-genus graphs.