Colouring Diamond-free Graphs - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2016

Colouring Diamond-free Graphs

Konrad K. Dabrowski
  • Function : Author
  • PersonId : 972724
François Dross
Daniël Paulusma

Abstract

The Colouring problem is that of deciding, given a graph G and an integer $k$, whether G admits a (proper) k-colouring. [...]

Dates and versions

lirmm-01481433 , version 1 (02-03-2017)

Identifiers

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⟩
85 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More