Cita APA (7a ed.)

Bonomo, F. (2014). b-Coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs.

Cita Chicago Style (17a ed.)

Bonomo, Flavia. B-Coloring Is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-cographs. 2014.

Cita MLA (8a ed.)

Bonomo, Flavia. B-Coloring Is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-cographs. 2014.