Recoloring bounded treewidth graphs - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier
Conference Papers Year : 2013

Recoloring bounded treewidth graphs

Marthe Bonamy
Algorithmes, Graphes et Combinatoire
Nicolas Bousquet
Algorithmes, Graphes et Combinatoire

Domains

Discrete Mathematics [cs.DM] Combinatorics [math.CO]

Alexandre Pinlou  : Connect in order to contact the contributor

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

Submitted on : Friday, January 29, 2016-11:44:18 AM

Last modification on : Monday, April 22, 2024-4:47:46 PM

Consult the full text

Dates and versions

lirmm-01264399 , version 1 (29-01-2016)

Identifiers

Cite

Marthe Bonamy, Nicolas Bousquet. Recoloring bounded treewidth graphs. LAGOS: Latin-American Algorithms, Graphs, and Optimization Symposium, 2013, Playa del Carmen, Mexico. pp.293-297, ⟨10.1016/j.endm.2013.10.040⟩. ⟨lirmm-01264399⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

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

Altmetric

Share

More