Colouring perfect graphs with bounded clique number

DOI10.1016/j.jctb.2016.09.006zbMath1350.05030arXiv1707.03747MaRDI QIDQ345123

Maria Chudnovsky, Aurélie Lagoutte, Sophie Spirkl, P. D. Seymour

Publication date: 25 November 2016

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1707.03747

zbMATH Keywords

perfect graph; colouring algorithm; balanced skew partition

Mathematics Subject Classification ID

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C15: Coloring of graphs and hypergraphs

05C17: Perfect graphs