On measures of the edge uncolorability of graphs with maximum degree thre
Résumé
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.
Domaines
Mathématique discrète [cs.DM]
Origine : Fichiers produits par l'(les) auteur(s)
Loading...