On measures of the edge uncolorability of graphs with maximum degree thre - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year : 2010

On measures of the edge uncolorability of graphs with maximum degree thre

Jean-Luc Fouquet
  • Function : Author
  • PersonId : 882580
Laboratoire d'Informatique Fondamentale d'Orléans

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]
Fichier principal
Vignette du fichier
Measure_Edge_Uncolorability_Janvier_24_2011.pdf (62.02 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Jean-Luc Fouquet  : Connect in order to contact the contributor

https://hal.science/hal-00535558

Submitted on : Thursday, January 27, 2011-6:39:45 PM

Last modification on : Saturday, June 25, 2022-10:11:26 AM

Long-term archiving on: Thursday, April 28, 2011-2:35:42 AM

Download

Dates and versions

hal-00535558 , version 1 (11-11-2010)
hal-00535558 , version 2 (27-01-2011)

Identifiers

  • HAL Id : hal-00535558 , version 2

Cite

Jean-Luc Fouquet. On measures of the edge uncolorability of graphs with maximum degree thre. 2010. ⟨hal-00535558v2⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

UNIV-ORLEANS MSL MSL-THESE TDS-MACS
104 View
42 Download

Share

Gmail Facebook X LinkedIn More