( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Four-Coloring \(P_6\)-Free Graphs. I. Extending an Excellent Precoloring.

, , и . SIAM J. Comput., 53 (1): 111-145 (февраля 2024)

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.

Lianmin Zhong

Yanlin Zhong

Gang Zhong

Weimin Zhong

Yang Zhong

 

Другие публикации лиц с тем же именем

Three-coloring graphs with no induced seven-vertex path I : the triangle-free case., , и . CoRR, (2014)Obstructions for three-coloring graphs with one forbidden induced subgraph., , , и . SODA, стр. 1774-1783. SIAM, (2016)Better 3-coloring algorithms: Excluding a triangle and a seven vertex path., , , , , , и . Theor. Comput. Sci., (2021)Complexity of Ck-coloring in hereditary classes of graphs., , , , и . CoRR, (2020)4-Coloring P6-Free Graphs with No Induced 5-Cycles., , , и . J. Graph Theory, 84 (3): 262-285 (2017)Approximately Coloring Graphs Without Long Induced Paths., , , , и . WG, том 10520 из Lecture Notes in Computer Science, стр. 193-205. Springer, (2017)Obstructions for Three-Coloring and List Three-Coloring H-Free Graphs., , , и . SIAM J. Discret. Math., 34 (1): 431-469 (2020)Four-Coloring \(P_6\)-Free Graphs. I. Extending an Excellent Precoloring., , и . SIAM J. Comput., 53 (1): 111-145 (февраля 2024)Complexity of Ck-coloring in hereditary classes of graphs., , , , и . Inf. Comput., (июня 2023)4-coloring $P_6$-free graphs with no induced 5-cycles., , , и . CoRR, (2014)