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.
An introduction to the dischargin g method via graph coloring
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Defines local identifying and locating-dominating codes and establishes asymptotically tight bounds for optimal sizes in binary hypercubes plus optimal densities for seven of eight grid constructions.
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.
-
Optimal local identifying and local locating-dominating codes
Defines local identifying and locating-dominating codes and establishes asymptotically tight bounds for optimal sizes in binary hypercubes plus optimal densities for seven of eight grid constructions.