Colouring Diamond-free Graphs
Abstract
The Colouring problem is that of deciding, given a graph G and an integer $k$, whether G admits a (proper) k-colouring. [...]
Conference Papers
Year : 2016
François Dross : Connect in order to contact the contributor
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01481433
Submitted on : Thursday, March 2, 2017-3:50:41 PM
Last modification on : Monday, March 18, 2024-3:37:05 PM
Dates and versions
Identifiers
- HAL Id : lirmm-01481433 , version 1
- ARXIV : 1512.07849v2
- DOI : 10.4230/LIPIcs.SWAT.2016.16
Cite
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⟩
91
View
0
Download