Flavia Bonomo and Maya Stein - Free people check

(1 - 6 from 6

)

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

collaborate.princeton.edu

Jan 4, · Flavia Bonomo-Braberman, Maria Chudnovsky, Jan Goedgebeur, Peter Maceli, Oliver Schaudt, Maya Stein, Mingxian Zhong. Mathematics.

Excluding Induced Paths: Graph Structure and Coloring | Academic ...academiccommons.columbia.edu › doi

academiccommons.columbia.edu

Apr 20, · ... and first appeared in. Working together with Flavia Bonomo, Oliver Schaudt, and Maya Stein, we have since simplified and extended this result.

Some Problems in Graph Theory and Scheduling | Academic ...academiccommons.columbia.edu › doi

academiccommons.columbia.edu

Sep 7, · This is joint work with Flavia Bonomo, Maria Chundnovsky, Peter Maceli, Oliver Schaudt, and Maya Stein. A graph is H-free if it has no induced ...

[ ] Better 3-coloring algorithms: excluding a triangle and a...

arxiv.org

Title: 3-Colouring graphs without triangles or induced paths on seven vertices. Authors: Flavia Bonomo, Oliver Schaudt, Maya Stein (Submitted on 30 Sep

[ ] b-coloring is NP-hard on co-bipartite graphs and polytime...

arxiv.org

Oct 29, · Title: b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs. Authors: Flavia Bonomo, Oliver Schaudt, Maya Stein,