Decomposition of sparse graphs into two forests, one having bounded maximum degree

Mickaël Montassier; André Raspaud; Xuding Zhu

doi:10.1016/j.ipl.2010.07.009

Journal Articles Information Processing Letters Year : 2010

Decomposition of sparse graphs into two forests, one having bounded maximum degree

(1) , (2) , (3)

1
2
3

Mickaël Montassier

Function : Author
PersonId : 7097
IdHAL : mickael-montassier
IdRef : 105605115

Algorithmes, Graphes et Combinatoire

CV

André Raspaud

Function : Author

Laboratoire Bordelais de Recherche en Informatique

Xuding Zhu

Function : Author

Commissariat à l'énergie atomique et aux énergies alternatives - Laboratoire d'Electronique et de Technologie de l'Information

Domains

Discrete Mathematics [cs.DM]

Mickael Montassier : Connect in order to contact the contributor

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01263807

Submitted on : Thursday, January 28, 2016-11:42:53 AM

Last modification on : Wednesday, September 4, 2024-3:06:15 AM

Dates and versions

lirmm-01263807 , version 1 (28-01-2016)

Identifiers

HAL Id : lirmm-01263807 , version 1
DOI : 10.1016/j.ipl.2010.07.009

Cite

Mickaël Montassier, André Raspaud, Xuding Zhu. Decomposition of sparse graphs into two forests, one having bounded maximum degree. Information Processing Letters, 2010, 110 (20), pp.913-916. ⟨10.1016/j.ipl.2010.07.009⟩. ⟨lirmm-01263807⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CEA CNRS UNIV-BORDEAUX ALGCO LIRMM DRT TDS-MACS MIPS UNIV-MONTPELLIER LETI CEA-GRE

143 View

0 Download

Decomposition of sparse graphs into two forests, one having bounded maximum degree

Domains

Dates and versions

Identifiers

Cite

Export

Collections

Altmetric

Share