( en | de | ru )

 

Disambiguation of "Zhong, Mingxian"

Author of the publication

copydeleteadd this publication to your clipboard
List 3-Coloring Graphs with No Induced P6+rP3.

, , , and . Algorithmica, 83 (1): 216-251 (2021)

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.

Lianmin Zhong

Gang Zhong

Yanlin Zhong

Weimin Zhong

Yang Zhong

 

Other publications of authors with the same name

Three-coloring graphs with no induced seven-vertex path I : the triangle-free case., , and . CoRR, (2014)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)Complexity of Ck-coloring in hereditary classes of graphs., , , , and . CoRR, (2020)4-Coloring P6-Free Graphs with No Induced 5-Cycles., , , and . J. Graph Theory, 84 (3): 262-285 (2017)Approximately Coloring Graphs Without Long Induced Paths., , , , and . WG, volume 10520 of Lecture Notes in Computer Science, page 193-205. Springer, (2017)4-coloring $P_6$-free graphs with no induced 5-cycles., , , and . CoRR, (2014)Obstructions for Three-Coloring and List Three-Coloring H-Free Graphs., , , and . SIAM J. Discret. Math., 34 (1): 431-469 (2020)Four-Coloring \(P_6\)-Free Graphs. I. Extending an Excellent Precoloring., , and . SIAM J. Comput., 53 (1): 111-145 (February 2024)Complexity of Ck-coloring in hereditary classes of graphs., , , , and . Inf. Comput., (June 2023)