Colouring Diamond-free Graphs

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

Bibliographic Details
Main Authors:	Dabrowski, Konrad K., Dross, François, Paulusma, Daniël
Other Authors:	Department of Computer Science, Durham University, Algorithmes, Graphes et Combinatoire (ALGCO), Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)
Format:	Conference Object
Language:	English
Published:	HAL CCSD 2016
Subjects:	[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM] [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO] Iceland
Online Access:	https://hal-lirmm.ccsd.cnrs.fr/lirmm-01481433 https://doi.org/10.4230/LIPIcs.SWAT.2016.16

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

Similar Items