Volgen
Mingxian Zhong
Mingxian Zhong
Lehman College, CUNY
Geverifieerd e-mailadres voor lehman.cuny.edu - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
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
962018
Four-coloring P6-free graphs
M Chudnovsky, S Spirkl, M Zhong
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
512019
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
232020
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
192017
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
172016
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
142015
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
142014
List 3-Coloring Graphs with No Induced
M Chudnovsky, S Huang, S Spirkl, M Zhong
Algorithmica 83, 216-251, 2021
122021
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
122020
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
102023
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
92020
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
82021
Scheduling when you do not know the number of machines
C Stein, M Zhong
ACM Transactions on Algorithms (TALG) 16 (1), 1-20, 2019
82019
Triangle-free graphs with no six-vertex induced path
M Chudnovsky, P Seymour, S Spirkl, M Zhong
Discrete Mathematics 341 (8), 2179-2196, 2018
62018
List-three-coloring graphs with no induced
M Chudnovsky, S Huang, S Spirkl, M Zhong
arXiv preprint arXiv:1806.11196, 2018
62018
Four-coloring P6-free graphs. II
M Chudnovsky, S Spirkl, M Zhong
Finding an excellent precoloring. arXiv, abs/1802.02283, 2018
62018
Three-coloring graphs with no induced six-edge path II: using a triangle
M Chudnovsky, P Maceli, M Zhong
Manuscript, 2015
52015
Three-coloring graphs with no induced six-edge path I: the triangle-free case
M Chudnovsky, P Maceli, M Zhong
preparation, 0
4
Approximately coloring graphs without long induced paths
M Chudnovsky, O Schaudt, S Spirkl, M Stein, M Zhong
Algorithmica 81, 3186-3199, 2019
32019
Four-Coloring -Free Graphs. I. Extending an Excellent Precoloring
M Chudnovsky, S Spirkl, M Zhong
SIAM Journal on Computing 53 (1), 111-145, 2024
22024
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20