%0 Journal Article %1 journals/disopt/DonneM11 %A Donne, Diego Delle %A Marenco, Javier %D 2011 %J Discret. Optim. %K dblp %N 4 %P 540-554 %T A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem. %U http://dblp.uni-trier.de/db/journals/disopt/disopt8.html#DonneM11 %V 8

@article{journals/disopt/DonneM11, added-at = {2023-11-12T00:00:00.000+0100}, author = {Donne, Diego Delle and Marenco, Javier}, biburl = {https://www.bibsonomy.org/bibtex/2f09a2557b8a19335e5bb150428252366/dblp}, ee = {https://doi.org/10.1016/j.disopt.2011.05.003}, interhash = {4e248c44d740fcf7d9c00bd732cd5050}, intrahash = {f09a2557b8a19335e5bb150428252366}, journal = {Discret. Optim.}, keywords = {dblp}, number = 4, pages = {540-554}, timestamp = {2024-04-09T01:58:23.000+0200}, title = {A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem.}, url = {http://dblp.uni-trier.de/db/journals/disopt/disopt8.html#DonneM11}, volume = 8, year = 2011 }