Delle Donne, D., & Marenco, J. L. (2011). A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem.
Cita Chicago Style (17a ed.)Delle Donne, Diego, y Javier Leonardo Marenco. A Branch-and-cut Algorithm for the Minimum-adjacency Vertex Coloring Problem. 2011.
Cita MLA (8a ed.)Delle Donne, Diego, y Javier Leonardo Marenco. A Branch-and-cut Algorithm for the Minimum-adjacency Vertex Coloring Problem. 2011.
Precaución: Estas citas no son 100% exactas.