Cita APA (7a ed.)

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

Cita Chicago Style (17a ed.)

Bonomo, F., O. Schaudt, M. Stein, y M. Valencia-Pabon. B-Coloring Is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs.

Cita MLA (8a ed.)

Bonomo, F., et al. B-Coloring Is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs.