On measures of the edge uncolorability of graphs with maximum degree thre
Abstract
M. Kochol (Three measures of edge-uncolorability, Discrete Mathematics 311 (2011), 106-108) study three invariants of graphs measuring how far a graph is from having a proper 3-edge-coloring. We show here how to get his main result easily.
Domains
Discrete Mathematics [cs.DM]
Origin : Files produced by the author(s)
Loading...