| Three-coloring and list three-coloring of graphs without induced paths on seven vertices F Bonomo, M Chudnovsky, P Maceli, O Schaudt, M Stein, M Zhong Combinatorica 38 (4), 779-801, 2018 | 99 | 2018 |
| Four-coloring P6-free graphs M Chudnovsky, S Spirkl, M Zhong Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 55 | 2019 |
| Obstructions for three-coloring graphs without induced paths on six vertices M Chudnovsky, J Goedgebeur, O Schaudt, M Zhong Journal of Combinatorial Theory, Series B 140, 45-83, 2020 | 27 | 2020 |
| 4‐Coloring P6‐Free Graphs with No Induced 5‐Cycles M Chudnovsky, P Maceli, J Stacho, M Zhong Journal of Graph Theory 84 (3), 262-285, 2017 | 19 | 2017 |
| Obstructions for three-coloring graphs with one forbidden induced subgraph M Chudnovsky, J Goedgebeur, O Schaudt, M Zhong Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016 | 19 | 2016 |
| List 3-Coloring Graphs with No Induced M Chudnovsky, S Huang, S Spirkl, M Zhong Algorithmica 83, 216-251, 2021 | 15 | 2021 |
| Three-coloring graphs with no induced seven-vertex path II: using a triangle M Chudnovsky, P Maceli, M Zhong arXiv preprint arXiv:1503.03573, 2015 | 14 | 2015 |
| Three-coloring graphs with no induced seven-vertex path I: the triangle-free case M Chudnovsky, P Maceli, M Zhong arXiv preprint arXiv:1409.5164, 2014 | 14 | 2014 |
| Complexity of Ck-coloring in hereditary classes of graphs M Chudnovsky, S Huang, P Rzążewski, S Spirkl, M Zhong Information and Computation 292, 105015, 2023 | 13 | 2023 |
| Obstructions for Three-Coloring and List Three-Coloring -Free Graphs M Chudnovsky, J Goedgebeur, O Schaudt, M Zhong SIAM Journal on Discrete Mathematics 34 (1), 431-469, 2020 | 13 | 2020 |
| List 3-coloring Pt-free graphs with no induced 1-subdivision of K1, s M Chudnovsky, S Spirkl, M Zhong Discrete Mathematics 343 (11), 112086, 2020 | 12 | 2020 |
| Scheduling when you do not know the number of machines C Stein, M Zhong ACM Transactions on Algorithms (TALG) 16 (1), 1-20, 2019 | 12 | 2019 |
| Better 3-coloring algorithms: excluding a triangle and a seven vertex path F Bonomo-Braberman, M Chudnovsky, J Goedgebeur, P Maceli, ... Theoretical Computer Science 850, 98-115, 2021 | 8 | 2021 |
| Four-Coloring -Free Graphs. I. Extending an Excellent Precoloring M Chudnovsky, S Spirkl, M Zhong SIAM Journal on Computing 53 (1), 111-145, 2024 | 6* | 2024 |
| Triangle-free graphs with no six-vertex induced path M Chudnovsky, P Seymour, S Spirkl, M Zhong Discrete Mathematics 341 (8), 2179-2196, 2018 | 6 | 2018 |
| List-three-coloring graphs with no induced M Chudnovsky, S Huang, S Spirkl, M Zhong arXiv preprint arXiv:1806.11196, 2018 | 6 | 2018 |
| Four-coloring P6-free graphs. II M Chudnovsky, S Spirkl, M Zhong Finding an excellent precoloring. arXiv, abs/1802.02283, 2018 | 6 | 2018 |
| Approximately coloring graphs without long induced paths M Chudnovsky, O Schaudt, S Spirkl, M Stein, M Zhong Algorithmica 81, 3186-3199, 2019 | 5 | 2019 |
| Three-coloring graphs with no induced six-edge path II: using a triangle M Chudnovsky, P Maceli, M Zhong Manuscript, 2015 | 5 | 2015 |
| Three-coloring graphs with no induced six-edge path I: the triangle-free case M Chudnovsky, P Maceli, M Zhong preparation, 0 | 4 | |
