Abuadas, Tala; Cameron, Ben; Hoàng, Chính T.; Sawada, Joe Vertex-critical \(( P_3 + \ell P_1 )\)-free and vertex-critical (gem, co-gem)-free graphs. (English) Zbl 07781878 Discrete Appl. Math. 344, 179-187 (2024). MSC: 05C15 68Q25 68R10 05C85 PDFBibTeX XMLCite \textit{T. Abuadas} et al., Discrete Appl. Math. 344, 179--187 (2024; Zbl 07781878) Full Text: DOI arXiv
Huang, Shenwei; Li, Zeyu Vertex-critical \((P_5, \mathrm{chair})\)-free graphs. (English) Zbl 1526.05050 Discrete Appl. Math. 341, 9-15 (2023). MSC: 05C15 05C60 PDFBibTeX XMLCite \textit{S. Huang} and \textit{Z. Li}, Discrete Appl. Math. 341, 9--15 (2023; Zbl 1526.05050) Full Text: DOI arXiv
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
Rojas Anríquez, Alberto; Stein, Maya 3-colouring \(P_t\)-free graphs without short odd cycles. (English) Zbl 07673386 Algorithmica 85, No. 4, 831-853 (2023). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{A. Rojas Anríquez} and \textit{M. Stein}, Algorithmica 85, No. 4, 831--853 (2023; Zbl 07673386) 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
Malyshev, D. S.; Pristavchenko, O. V. An intractability result for the vertex 3-colourability problem. (English) Zbl 1495.05101 Optim. Lett. 16, No. 5, 1403-1409 (2022). Reviewer: Tanja Dravec (Maribor) MSC: 05C15 68Q17 PDFBibTeX XMLCite \textit{D. S. Malyshev} and \textit{O. V. Pristavchenko}, Optim. Lett. 16, No. 5, 1403--1409 (2022; Zbl 1495.05101) Full Text: DOI
Cameron, Ben; Hoàng, Chính T.; Sawada, Joe Dichotomizing \(k\)-vertex-critical \(H\)-free graphs for \(H\) of order four. (English) Zbl 1485.05053 Discrete Appl. Math. 312, 106-115 (2022). MSC: 05C15 68Q25 05C85 05D10 68R10 PDFBibTeX XMLCite \textit{B. Cameron} et al., Discrete Appl. Math. 312, 106--115 (2022; Zbl 1485.05053) 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
Malyshev, D. S. The vertex colourability problem for \(\{\text{claw}, \text{butterfly}\}\)-free graphs is polynomial-time solvable. (English) Zbl 1466.05075 Optim. Lett. 15, No. 2, 311-326 (2021). MSC: 05C15 68Q17 PDFBibTeX XMLCite \textit{D. S. Malyshev}, Optim. Lett. 15, No. 2, 311--326 (2021; Zbl 1466.05075) Full Text: DOI
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
Malyshev, D. S.; Razvenskaya, O. O.; Pardalos, P. M. The computational complexity of weighted vertex coloring for \(\{P_5,K_{2,3},K^+_{2,3}\}\)-free graphs. (English) Zbl 1473.05092 Optim. Lett. 15, No. 1, 137-152 (2021). Reviewer: Steve Noble (London) MSC: 05C15 05C75 68Q17 PDFBibTeX XMLCite \textit{D. S. Malyshev} et al., Optim. Lett. 15, No. 1, 137--152 (2021; Zbl 1473.05092) Full Text: DOI
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
Cameron, Kathie; Goedgebeur, Jan; Huang, Shenwei; Shi, Yongtang \(k\)-critical graphs in \(P_5\)-free graphs. (English) Zbl 1502.05058 Kim, Donghyun (ed.) et al., Computing and combinatorics. 26th international conference, COCOON 2020, Atlanta, GA, USA, August 29–31, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12273, 411-422 (2020). MSC: 05C15 05C75 PDFBibTeX XMLCite \textit{K. Cameron} et al., Lect. Notes Comput. Sci. 12273, 411--422 (2020; Zbl 1502.05058) Full Text: DOI
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
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
Kamiński, Marcin; Pstrucha, Anna Certifying coloring algorithms for graphs without long induced paths. (English) Zbl 1410.05204 Discrete Appl. Math. 261, 258-267 (2019). MSC: 05C85 05C15 PDFBibTeX XMLCite \textit{M. Kamiński} and \textit{A. Pstrucha}, Discrete Appl. Math. 261, 258--267 (2019; Zbl 1410.05204) 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
Paulusma, Daniël; Picouleau, Christophe; Ries, Bernard Critical vertices and edges in \(H\)-free graphs. (English) Zbl 1406.05037 Discrete Appl. Math. 257, 361-367 (2019). MSC: 05C15 PDFBibTeX XMLCite \textit{D. Paulusma} et al., Discrete Appl. Math. 257, 361--367 (2019; Zbl 1406.05037) Full Text: DOI arXiv
Dabrowski, Konrad K.; Paulusma, Daniël On colouring \((2P_2,H)\)-free and \((P_5,H)\)-free graphs. (English) Zbl 1476.68200 Inf. Process. Lett. 134, 35-41 (2018). MSC: 68R10 05C15 05C85 68Q17 68Q25 PDFBibTeX XMLCite \textit{K. K. Dabrowski} and \textit{D. Paulusma}, Inf. Process. Lett. 134, 35--41 (2018; Zbl 1476.68200) 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