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. [.]
Main Authors: | , , |
---|---|
Other Authors: | , , , , |
Format: | Conference Object |
Language: | English |
Published: |
HAL CCSD
2016
|
Subjects: | |
Online Access: | https://hal-lirmm.ccsd.cnrs.fr/lirmm-01481433 https://doi.org/10.4230/LIPIcs.SWAT.2016.16 |
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. [.] |
---|