<?xml version="1.0"?>
<dblp>
<article key="journals/siamdm/CameronEHS07" mdate="2008-06-20">
<author>Kathie Cameron</author>
<author>Elaine M. Eschen</author>
<author>Ch&#237;nh T. Ho&#224;ng</author>
<author>R. Sritharan</author>
<title>The Complexity of the List Partition Problem for Graphs.</title>
<pages>900-929</pages>
<year>2007</year>
<volume>21</volume>
<journal>SIAM J. Discrete Math.</journal>
<number>4</number>
<ee>http://dx.doi.org/10.1137/060666238</ee>
<url>db/journals/siamdm/siamdm21.html#CameronEHS07</url>
</article>
</dblp>
