Colouring diamond-free graphs

DOI10.4230/LIPICS.SWAT.2016.16MaRDI QIDQ5369518zbMATH OpenOpenAlexFDO

Authors Konrad Dabrowski, François Dross, Daniël Paulusma

Publication date 17 October 2017

Full work available at URL http://drops.dagstuhl.de/opus/volltexte/2016/6038/

zbMATH Keywords

colouringclique-widthdiamond-free graphhereditary graph classgraph class

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Structural characterization of families of graphs (05C75)

Recommendations

• Colouring diamond-free graphs
• Bounding clique-width via perfect graphs
• On colouring \((2P_2,H)\)-free and \((P_5,H)\)-free graphs
• Decomposing and clique-coloring (diamond, odd-hole)-free graphs
• Colouring square-free graphs without long induced paths

Cited in

(9)

• scientific article; zbMATH DE number 7204407 (Why is no real title available?)
• On the chromatic number of (\(P_6\), diamond)-free graphs
• Well-quasi-ordering versus clique-width: new results on bigenic classes
• Well-quasi-ordering versus clique-width: new results on bigenic classes
• Colouring graphs with no induced six-vertex path or diamond
• Colouring diamond-free graphs
• Coloring (gem, co‐gem)‐free graphs
• Bounding clique-width via perfect graphs
• Anagram-free colorings of graphs

This page was built for publication: Colouring diamond-free graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5369518)