The Complexity of the List Partition Problem for Graphs

Authors

Kathie Cameron
Elaine M. Eschen
Chính T. Hoàng
R. Sritharan

Author ORCID Identifier

https://orcid.org/0000-0002-0112-2494

N/A

N/A

N/A

Document Type

Article

Publication Date

2008

Digital Commons Citation

Cameron, Kathie; Eschen, Elaine M.; Hoàng, Chính T.; and Sritharan, R., "The Complexity of the List Partition Problem for Graphs" (2008). Faculty & Staff Scholarship. 364.
https://researchrepository.wvu.edu/faculty_publications/364

Source Citation

Cameron, Kathie., Eschen, Elaine M., Hoàng, Chính T., & Sritharan, R. (2008). The Complexity Of The List Partition Problem For Graphs. SIAM Journal on Discrete Mathematics, 21(4), 900-929. http://doi.org/10.1137/060666238