Cai, Qingqiong; Goedgebeur, Jan; Huang, Shenwei Some results on \(k\)-critical \(P_5\)-free graphs. (English) Zbl 1512.05127 Discrete Appl. Math. 334, 91-100 (2023). MSC: 05C15 05C85 PDFBibTeX XMLCite \textit{Q. Cai} et al., Discrete Appl. Math. 334, 91--100 (2023; Zbl 1512.05127) Full Text: DOI arXiv
Huang, Shenwei; Li, Jiawei; Xia, Wen Critical (\(P_5\), bull)-free graphs. (English) Zbl 1512.05140 Discrete Appl. Math. 334, 15-25 (2023). MSC: 05C15 05C17 05C85 PDFBibTeX XMLCite \textit{S. Huang} et al., Discrete Appl. Math. 334, 15--25 (2023; Zbl 1512.05140) Full Text: DOI arXiv
Jelínek, Vít; Klimošová, Tereza; Masařík, Tomáš; Novotná, Jana; Pokorná, Aneta On 3-coloring of \((2P_4,C_5)\)-free graphs. (English) Zbl 07535644 Algorithmica 84, No. 6, 1526-1547 (2022). MSC: 68Wxx 05Cxx 05C75 PDFBibTeX XMLCite \textit{V. Jelínek} et al., Algorithmica 84, No. 6, 1526--1547 (2022; Zbl 07535644) Full Text: DOI
Jelínek, Vít; Klimošová, Tereza; Masařík, Tomáš; Novotná, Jana; Pokorná, Aneta On 3-coloring of \((2P_4,C_5)\)-free graphs. (English) Zbl 07538592 Kowalik, Łukasz (ed.) et al., Graph-theoretic concepts in computer science. 47th international workshop, WG 2021, Warsaw, Poland, June 23–25, 2021. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12911, 388-401 (2021). MSC: 68R10 PDFBibTeX XMLCite \textit{V. Jelínek} et al., Lect. Notes Comput. Sci. 12911, 388--401 (2021; Zbl 07538592) Full Text: DOI arXiv
Cameron, Kathie; Goedgebeur, Jan; Huang, Shenwei; Shi, Yongtang \(k\)-critical graphs in \(P_5\)-free graphs. (English) Zbl 1502.05057 Theor. Comput. Sci. 864, 80-91 (2021). MSC: 05C15 05C60 PDFBibTeX XMLCite \textit{K. Cameron} et al., Theor. Comput. Sci. 864, 80--91 (2021; Zbl 1502.05057) Full Text: DOI arXiv
Bonomo-Braberman, Flavia; Chudnovsky, Maria; Goedgebeur, Jan; Maceli, Peter; Schaudt, Oliver; Stein, Maya; Zhong, Mingxian Better 3-coloring algorithms: excluding a triangle and a seven vertex path. (English) Zbl 1468.05283 Theor. Comput. Sci. 850, 98-115 (2021). MSC: 05C85 05C15 PDFBibTeX XMLCite \textit{F. Bonomo-Braberman} et al., Theor. Comput. Sci. 850, 98--115 (2021; Zbl 1468.05283) Full Text: DOI arXiv
Chudnovsky, Maria; Goedgebeur, Jan; Schaudt, Oliver; Zhong, Mingxian Obstructions for three-coloring and list three-coloring \(H\)-free graphs. (English) Zbl 1433.05115 SIAM J. Discrete Math. 34, No. 1, 431-469 (2020). MSC: 05C15 05C85 05C60 PDFBibTeX XMLCite \textit{M. Chudnovsky} et al., SIAM J. Discrete Math. 34, No. 1, 431--469 (2020; Zbl 1433.05115) Full Text: DOI arXiv
Chudnovsky, Maria; Goedgebeur, Jan; Schaudt, Oliver; Zhong, Mingxian Obstructions for three-coloring graphs without induced paths on six vertices. (English) Zbl 1430.05033 J. Comb. Theory, Ser. B 140, 45-83 (2020). MSC: 05C15 05C30 05C60 PDFBibTeX XMLCite \textit{M. Chudnovsky} et al., J. Comb. Theory, Ser. B 140, 45--83 (2020; Zbl 1430.05033) Full Text: DOI arXiv
Huang, Shenwei; Li, Tao; Shi, Yongtang Critical \((P_6, \mathrm{banner})\)-free graphs. (English) Zbl 1407.05094 Discrete Appl. Math. 258, 143-151 (2019). MSC: 05C15 05C17 05C85 PDFBibTeX XMLCite \textit{S. Huang} et al., Discrete Appl. Math. 258, 143--151 (2019; Zbl 1407.05094) Full Text: DOI
Borowiecki, Piotr; Sidorowicz, Elżbieta Dynamic \(F\)-free coloring of graphs. (English) Zbl 1397.05059 Graphs Comb. 34, No. 3, 457-475 (2018). MSC: 05C15 05C85 05C75 PDFBibTeX XMLCite \textit{P. Borowiecki} and \textit{E. Sidorowicz}, Graphs Comb. 34, No. 3, 457--475 (2018; Zbl 1397.05059) Full Text: DOI
Borowiecki, Piotr Computational aspects of greedy partitioning of graphs. (English) Zbl 1385.68016 J. Comb. Optim. 35, No. 2, 641-665 (2018). MSC: 68Q25 05C15 05C70 05C85 68Q17 PDFBibTeX XMLCite \textit{P. Borowiecki}, J. Comb. Optim. 35, No. 2, 641--665 (2018; Zbl 1385.68016) Full Text: DOI
Goedgebeur, Jan; Schaudt, Oliver Exhaustive generation of \(k\)-critical \(\mathcal{H}\)-free graphs. (English) Zbl 1380.05063 J. Graph Theory 87, No. 2, 188-207 (2018). MSC: 05C15 05C85 PDFBibTeX XMLCite \textit{J. Goedgebeur} and \textit{O. Schaudt}, J. Graph Theory 87, No. 2, 188--207 (2018; Zbl 1380.05063) Full Text: DOI
Maffray, Frédéric; Pastor, Lucas 4-coloring \((P_6, \text{bull})\)-free graphs. (English) Zbl 1369.05082 Discrete Appl. Math. 231, 198-210 (2017). MSC: 05C15 05C85 PDFBibTeX XMLCite \textit{F. Maffray} and \textit{L. Pastor}, Discrete Appl. Math. 231, 198--210 (2017; Zbl 1369.05082) Full Text: DOI arXiv
Dabrowski, Konrad K.; Dross, François; Paulusma, Daniël Colouring diamond-free graphs. (English) Zbl 1372.05067 J. Comput. Syst. Sci. 89, 410-431 (2017). MSC: 05C15 05C60 05C69 05C12 PDFBibTeX XMLCite \textit{K. K. Dabrowski} et al., J. Comput. Syst. Sci. 89, 410--431 (2017; Zbl 1372.05067) Full Text: DOI arXiv
Golovach, Petr A.; Johnson, Matthew; Paulusma, Daniël; Song, Jian A survey on the computational complexity of coloring graphs with forbidden subgraphs. (English) Zbl 1359.05039 J. Graph Theory 84, No. 4, 331-363 (2017). MSC: 05C15 05C60 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., J. Graph Theory 84, No. 4, 331--363 (2017; Zbl 1359.05039) Full Text: DOI arXiv Link
Chudnovsky, Maria; Goedgebeur, Jan; Schaudt, Oliver; Zhong, Mingxian Obstructions for three-coloring graphs with one forbidden induced subgraph. (English) Zbl 1410.05063 Krauthgamer, Robert (ed.), Proceedings of the 27th annual ACM-SIAM symposium on discrete algorithms, SODA 2016, Arlington, VA, USA, January 10–12, 2016. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1774-1783 (2016). MSC: 05C15 05C85 68Q25 PDFBibTeX XMLCite \textit{M. Chudnovsky} et al., in: Proceedings of the 27th annual ACM-SIAM symposium on discrete algorithms, SODA 2016, Arlington, VA, USA, January 10--12, 2016. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1774--1783 (2016; Zbl 1410.05063) Full Text: DOI
Goedgebeur, Jan; Schaudt, Oliver Exhaustive generation of \(k\)-critical \(\mathcal H\)-free graphs. (English) Zbl 1417.05066 Heggernes, Pinar (ed.), Graph-theoretic concepts in computer science. 42nd international workshop, WG 2016, Istanbul, Turkey, June 22–24, 2016. Revised selected papers. Berlin: Springer. Lect. Notes Comput. Sci. 9941, 109-120 (2016). MSC: 05C15 05C85 PDFBibTeX XMLCite \textit{J. Goedgebeur} and \textit{O. Schaudt}, Lect. Notes Comput. Sci. 9941, 109--120 (2016; Zbl 1417.05066) Full Text: DOI arXiv