( en | de | ru )

 

Disambiguation of "Zhong, Mingxian"

Author of the publication

copydeleteadd this publication to your clipboard
Approximately Coloring Graphs Without Long Induced Paths.

, , , , and . WG, volume 10520 of Lecture Notes in Computer Science, page 193-205. Springer, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Gang Zhong

Lianmin Zhong

Weimin Zhong

Yanlin Zhong

Yang Zhong

 

Other publications of authors with the same name

Obstructions for three-coloring graphs with one forbidden induced subgraph., , , and . SODA, page 1774-1783. SIAM, (2016)Better 3-coloring algorithms: Excluding a triangle and a seven vertex path., , , , , , and . Theor. Comput. Sci., (2021)Approximately Coloring Graphs Without Long Induced Paths., , , , and . WG, volume 10520 of Lecture Notes in Computer Science, page 193-205. Springer, (2017)Four-Coloring \(P_6\)-Free Graphs. I. Extending an Excellent Precoloring., , and . SIAM J. Comput., 53 (1): 111-145 (February 2024)Four-coloring P6-free graphs. II. Finding an excellent precoloring., , and . CoRR, (2018)List 3-Coloring Graphs with No Induced P6+rP3., , , and . Algorithmica, 83 (1): 216-251 (2021)Four-coloring P6-free graphs., , and . SODA, page 1239-1256. SIAM, (2019)Obstructions for three-coloring graphs without induced paths on six vertices., , , and . J. Comb. Theory, Ser. B, (2020)Four-coloring Ps6-free graphs. I. Extending an excellent precoloring., , and . CoRR, (2018)Approximately Coloring Graphs Without Long Induced Paths., , , , and . Algorithmica, 81 (8): 3186-3199 (2019)