Gaspers, Serge; Huang, Shenwei Linearly \(\chi \)-bounding \((P_6, C_4)\)-free graphs. (English) Zbl 1429.05067 J. Graph Theory 92, No. 3, 322-342 (2019). MSC: 05C15 68W25 PDFBibTeX XMLCite \textit{S. Gaspers} and \textit{S. Huang}, J. Graph Theory 92, No. 3, 322--342 (2019; Zbl 1429.05067) Full Text: DOI arXiv
Gaspers, Serge; Huang, Shenwei; Paulusma, Daniël Colouring square-free graphs without long induced paths. (English) Zbl 1429.68081 J. Comput. Syst. Sci. 106, 60-79 (2019). MSC: 68Q25 05C15 68Q17 PDFBibTeX XMLCite \textit{S. Gaspers} et al., J. Comput. Syst. Sci. 106, 60--79 (2019; Zbl 1429.68081) Full Text: DOI arXiv Link
Gaspers, Serge; Huang, Shenwei \((2P_2,K_4)\)-free graphs are 4-colorable. (English) Zbl 1432.05041 SIAM J. Discrete Math. 33, No. 2, 1095-1120 (2019). MSC: 05C15 05C75 05C85 68W25 PDFBibTeX XMLCite \textit{S. Gaspers} and \textit{S. Huang}, SIAM J. Discrete Math. 33, No. 2, 1095--1120 (2019; Zbl 1432.05041) Full Text: DOI arXiv
Gaspers, Serge; Huang, Shenwei; Paulusma, Daniël Colouring square-free graphs without long induced paths. (English) Zbl 1487.68127 Niedermeier, Rolf (ed.) et al., 35th symposium on theoretical aspects of computer science, STACS 2018, Caen, France, February 28 – March 3, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 96, Article 35, 15 p. (2018). MSC: 68Q25 05C15 68Q17 68R10 PDFBibTeX XMLCite \textit{S. Gaspers} et al., LIPIcs -- Leibniz Int. Proc. Inform. 96, Article 35, 15 p. (2018; Zbl 1487.68127) Full Text: DOI
Gaspers, Serge; Huang, Shenwei Linearly \(\chi\)-bounding \((P_6,C_4)\)-free graphs. (English) Zbl 1483.05062 Bodlaender, Hans L. (ed.) et al., Graph-theoretic concepts in computer science. 43rd international workshop, WG 2017, Eindhoven, The Netherlands, June 21–23, 2017. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 10520, 263-274 (2017). MSC: 05C15 05C69 05C75 05C85 PDFBibTeX XMLCite \textit{S. Gaspers} and \textit{S. Huang}, Lect. Notes Comput. Sci. 10520, 263--274 (2017; Zbl 1483.05062) Full Text: DOI