Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Item Type | Date | No Grouping
Number of items: 5.

Bonomo, Flavia, Chudnovsky, Maria, Maceli, Peter, Schaudt, Oliver, Steinz, Maya and Zhong, Mingxian (2018). Three-Coloring and List Three-Coloring of Graphs Without Induced Paths on Seven Vertices. Combinatorica, 38 (4). S. 779 - 802. HEIDELBERG: SPRINGER HEIDELBERG. ISSN 1439-6912

Bonomo-Braberman, Flavia, Chudnovsky, Maria, Goedgebeur, Jan ORCID: 0000-0001-8984-2463, Maceli, Peter, Schaudt, Oliver, Stein, Maya and Zhong, Mingxian ORCID: 0000-0001-5924-1296 (2021). Better 3-coloring algorithms: Excluding a triangle and a seven vertex path. Theor. Comput. Sci., 850. S. 98 - 116. AMSTERDAM: ELSEVIER. ISSN 1879-2294

Chudnovsky, Maria, Goedgebeur, Jan ORCID: 0000-0001-8984-2463, Schaudt, Oliver and Zhong, Mingxian ORCID: 0000-0001-5924-1296 (2020). Obstructions for three-coloring graphs without induced paths on six vertices. J. Comb. Theory Ser. B, 140. S. 45 - 84. SAN DIEGO: ACADEMIC PRESS INC ELSEVIER SCIENCE. ISSN 1096-0902

Chudnovsky, Maria, Liu, Chun-Hung, Schaudt, Oliver, Spirkl, Sophie, Trotignon, Nicolas and Vuskovic, Kristina (2019). Triangle-free graphs that do not contain an induced subdivision of K-4 are 3-colorable. J. Graph Theory, 92 (2). S. 67 - 96. HOBOKEN: WILEY. ISSN 1097-0118

Chudnovsky, Maria, Schaudt, Oliver, Spirkl, Sophie, Stein, Maya and Zhong, Mingxian (2019). Approximately Coloring Graphs Without Long Induced Paths. Algorithmica, 81 (8). S. 3186 - 3200. NEW YORK: SPRINGER. ISSN 1432-0541

This list was generated on Fri Nov 22 20:08:55 2024 CET.