Mingxian Zhong

SIAM J. Comput., February, 2024

Four-Coloring $P_6$-Free Graphs. I. Extending an Excellent Precoloring.

[BibT_eX]

[DOI]

SIAM J. Comput., February, 2024

2023

Complexity of Ck-coloring in hereditary classes of graphs.

[BibT_eX]

[DOI]

Inf. Comput., June, 2023

2021

Better 3-coloring algorithms: Excluding a triangle and a seven vertex path.

[BibT_eX]

[DOI]

Flavia Bonomo-Braberman

Theor. Comput. Sci., 2021

List 3-Coloring Graphs with No Induced P6+rP3.

[BibT_eX]

[DOI]

Algorithmica, 2021

2020

Scheduling When You Do Not Know the Number of Machines.

[BibT_eX]

[DOI]

Clifford Stein

ACM Trans. Algorithms, 2020

Obstructions for Three-Coloring and List Three-Coloring H-Free Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2020

Obstructions for three-coloring graphs without induced paths on six vertices.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2020

List 3-coloring Pt-free graphs with no induced 1-subdivision of K1, s.

[BibT_eX]

[DOI]

Discret. Math., 2020

List-three-coloring Pt-free graphs with no induced 1-subdivision of K1, s.

[BibT_eX]

[DOI]

CoRR, 2020

2019

Approximately Coloring Graphs Without Long Induced Paths.

[BibT_eX]

[DOI]

Algorithmica, 2019

Four-coloring P6-free graphs.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Complexity of Ck-Coloring in Hereditary Classes of Graphs.

[BibT_eX]

[DOI]

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018

Some Problems in Graph Theory and Scheduling.

[BibT_eX]

[DOI]

PhD thesis, 2018

Triangle-free graphs with no six-vertex induced path.

[BibT_eX]

[DOI]

Discret. Math., 2018

Four-coloring P6-free graphs. II. Finding an excellent precoloring.

[BibT_eX]

[DOI]

CoRR, 2018

Four-coloring Ps6-free graphs. I. Extending an excellent precoloring.

[BibT_eX]

[DOI]

CoRR, 2018

Three-Coloring and List Three-Coloring of Graphs Without Induced Paths on Seven Vertices.

[BibT_eX]

[DOI]

Comb., 2018

Scheduling When You Don't Know the Number of Machines.

[BibT_eX]

[DOI]

Clifford Stein

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017

4-Coloring P6-Free Graphs with No Induced 5-Cycles.

[BibT_eX]

[DOI]

J. Graph Theory, 2017

2016

Obstructions for three-coloring graphs with one forbidden induced subgraph.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015

Three-coloring graphs with no induced seven-vertex path II : using a triangle.

[BibT_eX]

[DOI]

Peter Maceli

CoRR, 2015

2014

Three-coloring graphs with no induced seven-vertex path I : the triangle-free case.

[BibT_eX]

[DOI]

Peter Maceli