Colouring Diamond-free Graphs

Konrad K. Dabrowski 1 François Dross 2 Daniël Paulusma 1
2 ALGCO - Algorithmes, Graphes et Combinatoire
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Résumé : The Colouring problem is that of deciding, given a graph G and an integer $k$, whether G admits a (proper) k-colouring. [...]
Complete list of metadatas

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01481433
Contributor : François Dross <>
Submitted on : Thursday, March 2, 2017 - 3:50:41 PM
Last modification on : Thursday, July 19, 2018 - 4:58:09 PM

Links full text

Identifiers

Collections

Citation

Konrad K. Dabrowski, François Dross, Daniël Paulusma. Colouring Diamond-free Graphs. SWAT: Scandinavian Workshops on Algorithm Theory, 2016, Reykjavik, Iceland. pp.16:1--16:14, ⟨10.4230/LIPIcs.SWAT.2016.16⟩. ⟨lirmm-01481433⟩

Share

Metrics

Record views

137