Partitioning sparse graphs into an independent set and a forest of bounded degree - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier
Conference Papers Year : 2016

Partitioning sparse graphs into an independent set and a forest of bounded degree

François Dross
Algorithmes, Graphes et Combinatoire
Mickaël Montassier
Algorithmes, Graphes et Combinatoire
CV
Alexandre Pinlou
Algorithmes, Graphes et Combinatoire
CV

Domains

Discrete Mathematics [cs.DM]

Mickael Montassier  : Connect in order to contact the contributor

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

Submitted on : Tuesday, January 10, 2017-12:00:17 PM

Last modification on : Friday, March 24, 2023-2:53:03 PM

Consult the full text

Dates and versions

lirmm-01430813 , version 1 (10-01-2017)

Identifiers

Cite

François Dross, Mickaël Montassier, Alexandre Pinlou. Partitioning sparse graphs into an independent set and a forest of bounded degree. BGW: Bordeaux Graph Workshop, Nov 2016, Bordeaux, France. ⟨lirmm-01430813⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS ALGCO LIRMM TDS-MACS MIPS UNIV-MONTPELLIER
125 View
0 Download

Altmetric

Share

More