Chudnovsky, Maria; Norin, Sergey; Seymour, Paul D.; Turcotte, Jérémie Cops and robbers on \(P_5\)-free graphs. (English) Zbl 07818427 SIAM J. Discrete Math. 38, No. 1, 845-856 (2024). MSC: 05C57 91A43 91A24 PDFBibTeX XMLCite \textit{M. Chudnovsky} et al., SIAM J. Discrete Math. 38, No. 1, 845--856 (2024; Zbl 07818427) Full Text: DOI arXiv
Chudnovsky, Maria; Huang, Shenwei; Karthick, T.; Kaufmann, Jenny Square-free graphs with no induced fork. (English) Zbl 1464.05146 Electron. J. Comb. 28, No. 2, Research Paper P2.20, 16 p. (2021). MSC: 05C15 05C60 PDFBibTeX XMLCite \textit{M. Chudnovsky} et al., Electron. J. Comb. 28, No. 2, Research Paper P2.20, 16 p. (2021; Zbl 1464.05146) Full Text: DOI
Chudnovsky, Maria; Dibek, Cemil; Seymour, Paul New examples of minimal non-strongly-perfect graphs. (English) Zbl 1460.05071 Discrete Math. 344, No. 5, Article ID 112334, 7 p. (2021). MSC: 05C17 05C60 05C75 PDFBibTeX XMLCite \textit{M. Chudnovsky} et al., Discrete Math. 344, No. 5, Article ID 112334, 7 p. (2021; Zbl 1460.05071) 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; Spirkl, Sophie; Zhong, Mingxian List 3-coloring \(P_t\)-free graphs with no induced 1-subdivision of \(K_{1 , s}\). (English) Zbl 1471.05033 Discrete Math. 343, No. 11, Article ID 112086, 4 p. (2020). Reviewer: Boštjan Kuzman (Ljubljana) MSC: 05C15 05C69 05C85 68Q25 PDFBibTeX XMLCite \textit{M. Chudnovsky} et al., Discrete Math. 343, No. 11, Article ID 112086, 4 p. (2020; Zbl 1471.05033) Full Text: DOI arXiv
Chudnovsky, Maria; Cook, Linda; Seymour, Paul Excluding the fork and antifork. (English) Zbl 1435.05144 Discrete Math. 343, No. 5, Article ID 111786, 12 p. (2020). MSC: 05C60 05C10 PDFBibTeX XMLCite \textit{M. Chudnovsky} et al., Discrete Math. 343, No. 5, Article ID 111786, 12 p. (2020; Zbl 1435.05144) Full Text: DOI
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
Chudnovsky, Maria; Schaudt, Oliver; Spirkl, Sophie; Stein, Maya; Zhong, Mingxian Approximately coloring graphs without long induced paths. (English) Zbl 1428.05101 Algorithmica 81, No. 8, 3186-3199 (2019). MSC: 05C15 05C85 68W25 PDFBibTeX XMLCite \textit{M. Chudnovsky} et al., Algorithmica 81, No. 8, 3186--3199 (2019; Zbl 1428.05101) Full Text: DOI arXiv
Chudnovsky, Maria; Esperet, Louis; Lemoine, Laetitia; Maceli, Peter; Maffray, Frédéric; Penev, Irena Graphs with no induced five-vertex path or antipath. (English) Zbl 1359.05083 J. Graph Theory 84, No. 3, 221-232 (2017). MSC: 05C60 PDFBibTeX XMLCite \textit{M. Chudnovsky} et al., J. Graph Theory 84, No. 3, 221--232 (2017; Zbl 1359.05083) Full Text: DOI arXiv
Chudnovsky, Maria; Zwols, Yori Large cliques or stable sets in graphs with no four-edge path and no five-edge path in the complement. (English) Zbl 1247.05151 J. Graph Theory 70, No. 4, 449-472 (2012). MSC: 05C60 PDFBibTeX XMLCite \textit{M. Chudnovsky} and \textit{Y. Zwols}, J. Graph Theory 70, No. 4, 449--472 (2012; Zbl 1247.05151) Full Text: DOI
Chudnovsky, Maria; Ries, Bernard; Zwols, Yori Claw-free graphs with strongly perfect complements. Fractional and integral version. II: Nontrivial strip-structures. (English) Zbl 1239.05080 Discrete Appl. Math. 159, No. 17, 1996-2029 (2011). MSC: 05C17 05C75 68R10 PDFBibTeX XMLCite \textit{M. Chudnovsky} et al., Discrete Appl. Math. 159, No. 17, 1996--2029 (2011; Zbl 1239.05080) Full Text: DOI
Chudnovsky, Maria; Ries, Bernard; Zwols, Yori Claw-free graphs with strongly perfect complements. Fractional and integral version. I: Basic graphs. (English) Zbl 1239.05079 Discrete Appl. Math. 159, No. 17, 1971-1995 (2011). MSC: 05C17 05C75 68M10 PDFBibTeX XMLCite \textit{M. Chudnovsky} et al., Discrete Appl. Math. 159, No. 17, 1971--1995 (2011; Zbl 1239.05079) Full Text: DOI