%0 Journal Article %1 journals/siamdm/CameronEHS07 %A Cameron, Kathie %A Eschen, Elaine M. %A Hoàng, Chính T. %A Sritharan, R. %D 2007 %J SIAM J. Discret. Math. %K dblp %N 4 %P 900-929 %T The Complexity of the List Partition Problem for Graphs. %U http://dblp.uni-trier.de/db/journals/siamdm/siamdm21.html#CameronEHS07 %V 21

@article{journals/siamdm/CameronEHS07, added-at = {2020-04-25T00:00:00.000+0200}, author = {Cameron, Kathie and Eschen, Elaine M. and Hoàng, Chính T. and Sritharan, R.}, biburl = {https://www.bibsonomy.org/bibtex/2411a653d959b212bb2ae1a8533d06e2f/dblp}, ee = {https://doi.org/10.1137/060666238}, interhash = {21f34dfe6f905fa42ad6e89cb61d1095}, intrahash = {411a653d959b212bb2ae1a8533d06e2f}, journal = {SIAM J. Discret. Math.}, keywords = {dblp}, number = 4, pages = {900-929}, timestamp = {2020-04-28T11:51:35.000+0200}, title = {The Complexity of the List Partition Problem for Graphs.}, url = {http://dblp.uni-trier.de/db/journals/siamdm/siamdm21.html#CameronEHS07}, volume = 21, year = 2007 }