4-coloring $P_6$-free graphs with no induced 5-cycles. - Maria Chudnovsky; Peter Maceli; Juraj Stacho; Mingxian Zhong (CoRR, 2014)

Three-coloring graphs with no induced seven-vertex path I : the triangle-free case. - Maria Chudnovsky; Peter Maceli; Mingxian Zhong (CoRR, 2014)

Three-coloring graphs with no induced seven-vertex path II : using a triangle. - Maria Chudnovsky; Peter Maceli; Mingxian Zhong (CoRR, 2015)

Obstructions for three-coloring graphs with one forbidden induced subgraph. - Maria Chudnovsky; Jan Goedgebeur; Oliver Schaudt; Mingxian Zhong (SODA, 2016)

4-Coloring P6-Free Graphs with No Induced 5-Cycles. - Maria Chudnovsky; Peter Maceli; Juraj Stacho; Mingxian Zhong (J. Graph Theory, 2017)

Scheduling When You Don't Know the Number of Machines. - Clifford Stein 001; Mingxian Zhong (SODA, 2018)

Three-Coloring and List Three-Coloring of Graphs Without Induced Paths on Seven Vertices. - Flavia Bonomo; Maria Chudnovsky; Peter Maceli; Oliver Schaudt; Maya Stein; Mingxian Zhong (Comb., 2018)

Four-coloring Ps6-free graphs. I. Extending an excellent precoloring. - Maria Chudnovsky; Sophie Spirkl; Mingxian Zhong (CoRR, 2018)

Four-coloring P6-free graphs. II. Finding an excellent precoloring. - Maria Chudnovsky; Sophie Spirkl; Mingxian Zhong (CoRR, 2018)

Triangle-free graphs with no six-vertex induced path. - Maria Chudnovsky; Paul D. Seymour; Sophie Spirkl; Mingxian Zhong (Discret. Math., 2018)

Some Problems in Graph Theory and Scheduling. - Mingxian Zhong (2018)

Complexity of Ck-Coloring in Hereditary Classes of Graphs. - Maria Chudnovsky; Shenwei Huang; Pawel Rzazewski; Sophie Spirkl; Mingxian Zhong (ESA, 2019)

Four-coloring P6-free graphs. - Sophie Spirkl; Maria Chudnovsky; Mingxian Zhong (SODA, 2019)

Approximately Coloring Graphs Without Long Induced Paths. - Maria Chudnovsky; Oliver Schaudt; Sophie Spirkl; Maya Stein; Mingxian Zhong (Algorithmica, 2019)

List-three-coloring Pt-free graphs with no induced 1-subdivision of K1, s. - Maria Chudnovsky; Sophie Spirkl; Mingxian Zhong (CoRR, 2020)

List 3-coloring Pt-free graphs with no induced 1-subdivision of K1, s. - Maria Chudnovsky; Sophie Spirkl; Mingxian Zhong (Discret. Math., 2020)

Obstructions for three-coloring graphs without induced paths on six vertices. - Maria Chudnovsky; Jan Goedgebeur; Oliver Schaudt; Mingxian Zhong (J. Comb. Theory, Ser. B, 2020)

Obstructions for Three-Coloring and List Three-Coloring H-Free Graphs. - Maria Chudnovsky; Jan Goedgebeur; Oliver Schaudt; Mingxian Zhong (SIAM J. Discret. Math., 2020)

Scheduling When You Do Not Know the Number of Machines. - Clifford Stein 001; Mingxian Zhong (ACM Trans. Algorithms, 2020)

List 3-Coloring Graphs with No Induced P6+rP3. - Maria Chudnovsky; Shenwei Huang; Sophie Spirkl; Mingxian Zhong (Algorithmica, 2021)

Better 3-coloring algorithms: Excluding a triangle and a seven vertex path. - Flavia Bonomo-Braberman; Maria Chudnovsky; Jan Goedgebeur; Peter Maceli; Oliver Schaudt; Maya Stein; Mingxian Zhong (Theor. Comput. Sci., 2021)

Complexity of Ck-coloring in hereditary classes of graphs. - Maria Chudnovsky; Shenwei Huang; Pawel Rzazewski; Sophie Spirkl; Mingxian Zhong (Inf. Comput., 2023)

Four-Coloring (P_6 )-Free Graphs. I. Extending an Excellent Precoloring. - Maria Chudnovsky; Sophie Spirkl; Mingxian Zhong (SIAM J. Comput., 2024)

Four-Coloring ( boldsymbol{P_6} )-Free Graphs. II. Finding an Excellent Precoloring. - Maria Chudnovsky; Sophie Spirkl; Mingxian Zhong (SIAM J. Comput., 2024)