Mingxian Zhong

29 papers A* 3A 1B 1Journal 23
YearRankTypeTitle / Venue / Authors
2024 J jnl
Four-Coloring \(P_6\)-Free Graphs. I. Extending an Excellent Precoloring.
SIAM J. Comput.
Maria Chudnovsky, Sophie Spirkl, Mingxian Zhong
2024 J jnl
Four-Coloring \(\boldsymbol{P_6}\)-Free Graphs. II. Finding an Excellent Precoloring.
SIAM J. Comput.
Maria Chudnovsky, Sophie Spirkl, Mingxian Zhong
2023 J jnl
Complexity of
Inf. Comput.
Maria Chudnovsky, Shenwei Huang, Pawel Rzazewski, Sophie Spirkl, Mingxian Zhong
2021 J jnl
Better 3-coloring algorithms: Excluding a triangle and a seven vertex path.
Theor. Comput. Sci.
Flavia Bonomo-Braberman, Maria Chudnovsky, Jan Goedgebeur, Peter Maceli, Oliver Schaudt, Maya Stein, Mingxian Zhong
2021 J jnl
List 3-Coloring Graphs with No Induced P
Algorithmica
Maria Chudnovsky, Shenwei Huang, Sophie Spirkl, Mingxian Zhong
2020 J jnl
Complexity of C
CoRR
Maria Chudnovsky, Shenwei Huang, Pawel Rzazewski, Sophie Spirkl, Mingxian Zhong
2020 J jnl
List 3-coloring Pt-free graphs with no induced 1-subdivision of K1, s.
Discret. Math.
Maria Chudnovsky, Sophie Spirkl, Mingxian Zhong
2020 J jnl
List-three-coloring P
CoRR
Maria Chudnovsky, Sophie Spirkl, Mingxian Zhong
2020 J jnl
Obstructions for Three-Coloring and List Three-Coloring H-Free Graphs.
SIAM J. Discret. Math.
Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong
2020 J jnl
Obstructions for three-coloring graphs without induced paths on six vertices.
J. Comb. Theory, Ser. B
Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong
2020 J jnl
Scheduling When You Do Not Know the Number of Machines.
ACM Trans. Algorithms
Clifford Stein, Mingxian Zhong
2019 J jnl
Approximately Coloring Graphs Without Long Induced Paths.
Algorithmica
Maria Chudnovsky, Oliver Schaudt, Sophie Spirkl, Maya Stein, Mingxian Zhong
2019 A conf
Complexity of C
ESA
Maria Chudnovsky, Shenwei Huang, Pawel Rzazewski, Sophie Spirkl, Mingxian Zhong
2019 A* conf
Four-coloring P6-free graphs.
SODA
Sophie Spirkl, Maria Chudnovsky, Mingxian Zhong
2018 J jnl
Four-coloring P
CoRR
Maria Chudnovsky, Sophie Spirkl, Mingxian Zhong
2018 J jnl
Four-coloring Ps
CoRR
Maria Chudnovsky, Sophie Spirkl, Mingxian Zhong
2018 A* conf
Scheduling When You Don't Know the Number of Machines.
SODA
Clifford Stein, Mingxian Zhong
2018 — —
Some Problems in Graph Theory and Scheduling.
Mingxian Zhong
2018 J jnl
Three-Coloring and List Three-Coloring of Graphs Without Induced Paths on Seven Vertices.
Comb.
Flavia Bonomo, Maria Chudnovsky, Peter Maceli, Oliver Schaudt, Maya Stein, Mingxian Zhong
2018 J jnl
Triangle-free graphs with no six-vertex induced path.
Discret. Math.
Maria Chudnovsky, Paul D. Seymour, Sophie Spirkl, Mingxian Zhong
2017 J jnl
4-Coloring
J. Graph Theory
Maria Chudnovsky, Peter Maceli, Juraj Stacho, Mingxian Zhong
2017 B conf
Approximately Coloring Graphs Without Long Induced Paths.
WG
Maria Chudnovsky, Oliver Schaudt, Sophie Spirkl, Maya Stein, Mingxian Zhong
2017 J jnl
Obstructions for three-coloring and list three-coloring H-free graphs.
CoRR
Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong
2016 J jnl
Approximately coloring graphs without long induced paths.
CoRR
Maria Chudnovsky, Oliver Schaudt, Sophie Spirkl, Maya Stein, Mingxian Zhong
2016 A* conf
Obstructions for three-coloring graphs with one forbidden induced subgraph.
SODA
Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong
2015 J jnl
Obstructions for three-coloring graphs without induced paths on six vertices.
CoRR
Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong
2015 J jnl
Three-coloring graphs with no induced seven-vertex path II : using a triangle.
CoRR
Maria Chudnovsky, Peter Maceli, Mingxian Zhong
2014 J jnl
4-coloring $P_6$-free graphs with no induced 5-cycles.
CoRR
Maria Chudnovsky, Peter Maceli, Juraj Stacho, Mingxian Zhong
2014 J jnl
Three-coloring graphs with no induced seven-vertex path I : the triangle-free case.
CoRR
Maria Chudnovsky, Peter Maceli, Mingxian Zhong