Mostrar el registro sencillo del ítem

hal.structure.identifierLaboratoire Bordelais de Recherche en Informatique [LaBRI]
dc.contributor.authorMONTASSIER, Mickael
hal.structure.identifierLaboratoire Bordelais de Recherche en Informatique [LaBRI]
hal.structure.identifierReformulations based algorithms for Combinatorial Optimization [Realopt]
dc.contributor.authorPÊCHER, Arnaud
hal.structure.identifierLaboratoire Bordelais de Recherche en Informatique [LaBRI]
dc.contributor.authorRASPAUD, André
hal.structure.identifierDepartment of Applied Mathematics [Kaohsiung]
dc.contributor.authorZHU, Xuding
dc.date.accessioned2024-04-04T02:41:13Z
dc.date.available2024-04-04T02:41:13Z
dc.date.created2009-03-04
dc.date.issued2009-03-04
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/191132
dc.descriptionRapport de recherche RR-1453-09 LaBRI
dc.description.abstractEnIn this note, we prove that every graph with maximum average degree less than $\frac{32}{13}$ (resp. $\frac{30}{11}$, $\frac{32}{11}$, $\frac{70}{23}$) admits an edge-partition into a forest and a subgraph of maximum degree 1 (resp. 2, 3, 4). This implies that these graphs have game coloring number at most 5, 6, 7, 8, respectively.
dc.language.isoen
dc.title.enEdge-partitions of sparse graphs and their applications to game coloring
dc.typeAutre document
dc.subject.halInformatique [cs]/Mathématique discrète [cs.DM]
bordeaux.hal.laboratoriesInstitut de Mathématiques de Bordeaux (IMB) - UMR 5251*
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
hal.identifierhal-00368828
hal.version1
hal.popularnon
hal.audienceNon spécifiée
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-00368828v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.date=2009-03-04&rft.au=MONTASSIER,%20Mickael&P%C3%8ACHER,%20Arnaud&RASPAUD,%20Andr%C3%A9&ZHU,%20Xuding&rft.genre=unknown


Archivos en el ítem

ArchivosTamañoFormatoVer

No hay archivos asociados a este ítem.

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem