Cita APA

Bonomo, F., Schaudt, O., Stein, M., & Valencia Pabon, M. (2015). b-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree Cographs. Web

Citación estilo Chicago

Bonomo, Flavia, Oliver Schaudt, Maya Stein, and Mario Valencia Pabon. B-Coloring Is NP-hard On Co-bipartite Graphs and Polytime Solvable On Tree Cographs. 2015.

Cita MLA

Bonomo, Flavia, Oliver Schaudt, Maya Stein, and Mario Valencia Pabon. B-Coloring Is NP-hard On Co-bipartite Graphs and Polytime Solvable On Tree Cographs. 2015.