Mingxian Zhong
Mingxian Zhong
Lehman College, CUNY
E-mail confirmado em lehman.cuny.edu - Página inicial
Título
Citado por
Citado por
Ano
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
672018
Four-coloring P6-free graphs
M Chudnovsky, S Spirkl, M Zhong
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
192019
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
172017
Obstructions for three-coloring graphs without induced paths on six vertices
M Chudnovsky, J Goedgebeur, O Schaudt, M Zhong
arXiv preprint arXiv:1504.06979, 2015
16*2015
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
152016
Four-coloring -free graphs. II. Finding an excellent precoloring
M Chudnovsky, S Spirkl, M Zhong
arXiv preprint arXiv:1802.02283, 2018
132018
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
132015
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
132014
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
62020
Scheduling when you do not know the number of machines
C Stein, M Zhong
ACM Transactions on Algorithms (TALG) 16 (1), 1-20, 2019
52019
Triangle-free graphs with no six-vertex induced path
M Chudnovsky, P Seymour, S Spirkl, M Zhong
Discrete Mathematics 341 (8), 2179-2196, 2018
52018
Four-coloring P6-free graphs. II
M Chudnovsky, S Spirkl, M Zhong
Finding an excellent precoloring. arXiv, abs/1802.02283, 2018
52018
Three-coloring graphs with no induced six-edge path II: using a triangle
M Chudnovsky, P Maceli, M Zhong
Manuscript, 2015
52015
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
42020
List-three-coloring graphs with no induced
M Chudnovsky, S Huang, S Spirkl, M Zhong
arXiv preprint arXiv:1806.11196, 2018
42018
Three-coloring graphs with no induced six-edge path I: the triangle-free case
M Chudnovsky, P Maceli, M Zhong
preparation, 0
4
List 3-Coloring Graphs with No Induced P 6 + r P 3
M Chudnovsky, S Huang, S Spirkl, M Zhong
Algorithmica 83 (1), 216-251, 2021
22021
List-three-coloring -free graphs with no induced 1-subdivision of
M Chudnovsky, S Spirkl, M Zhong
arXiv preprint arXiv:2006.03009, 2020
22020
Complexity of -coloring in hereditary classes of graphs
M Chudnovsky, S Huang, P Rzążewski, S Spirkl, M Zhong
arXiv preprint arXiv:2005.01824, 2020
22020
Approximately coloring graphs without long induced paths
M Chudnovsky, O Schaudt, S Spirkl, M Stein, M Zhong
Algorithmica 81 (8), 3186-3199, 2019
22019
O sistema não pode executar a operação agora. Tente novamente mais tarde.
Artigos 1–20