Colouring Diamond-free Graphs.
From MaRDI portal
Publication:5369518
DOI10.4230/LIPIcs.SWAT.2016.16zbMath1378.68070OpenAlexW2724945753MaRDI QIDQ5369518
Konrad K. Dabrowski, Daniël Paulusma, François Dross
Publication date: 17 October 2017
Full work available at URL: http://drops.dagstuhl.de/opus/volltexte/2016/6038/
Analysis of algorithms and problem complexity (68Q25) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)
Related Items
Colouring diamond-free graphs ⋮ On the chromatic number of (\(P_6\), diamond)-free graphs ⋮ Well-quasi-ordering versus clique-width: new results on bigenic classes ⋮ Unnamed Item ⋮ Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes