Afficher la notice abrégée

dc.contributor.authorNguyen, Viet Hung*
dc.contributor.authorCornaz, Denis*
dc.date.accessioned2013-11-02T14:33:24Z
dc.date.available2013-11-02T14:33:24Z
dc.date.issued2013-11-02
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/11971
dc.language.isoenen
dc.subjectTDI systemen
dc.subjectSubstar polytopeen
dc.subjectKőnig’s edge-colouring theoremen
dc.subject.ddc511en
dc.titleKőnig’s edge-colouring theorem for all graphsen
dc.typeArticle accepté pour publication ou publié
dc.contributor.editoruniversityotherLIP6, University Pierre et Marie Curie Paris 6;France
dc.description.abstractenWe show that the maximum degree of a graph G is equal to the minimum number of ocm sets covering G, where an ocm set is the vertex-disjoint union of elementary odd cycles and one matching, and a collection of ocm sets covers G if every edge is in the matching of an ocm set or in some odd cycle of at least two ocm sets.en
dc.relation.isversionofjnlnameOperations Research Letters
dc.relation.isversionofjnlvol41en
dc.relation.isversionofjnlissue6en
dc.relation.isversionofjnldate2013
dc.relation.isversionofjnlpages592-596en
dc.relation.isversionofdoihttp://dx.doi.org/10.1016/j.orl.2013.08.005en
dc.relation.isversionofjnlpublisherElsevieren
dc.subject.ddclabelPrincipes généraux des mathématiquesen
dc.relation.forthcomingnonen
dc.relation.forthcomingprintnonen
hal.person.labIds*
hal.person.labIds*


Fichiers attachés à cette notice

FichiersTailleFormatConsulter

Il n'y a pas de fichiers associés à cette notice.

Ce document fait partie de la (des) collection(s) suivante(s)

Afficher la notice abrégée