Leo G. Kroon, Arunabha Sen, Haiyong Deng, Asim Roy. The Optimal Cost Chromatic Partition Problem for Trees and Interval Graphs. In Fabrizio d Amore, Paolo Giulio Franciosa, Alberto Marchetti-Spaccamela, editors, Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, WG 96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings. Volume 1197 of Lecture Notes in Computer Science, pages 279-292, Springer, 1996.
@inproceedings{KroonSDR96, title = {The Optimal Cost Chromatic Partition Problem for Trees and Interval Graphs}, author = {Leo G. Kroon and Arunabha Sen and Haiyong Deng and Asim Roy}, year = {1996}, tags = {graph-rewriting, rewriting, partitioning}, researchr = {https://researchr.org/publication/KroonSDR96}, cites = {0}, citedby = {0}, pages = {279-292}, booktitle = {Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, WG 96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings}, editor = {Fabrizio d Amore and Paolo Giulio Franciosa and Alberto Marchetti-Spaccamela}, volume = {1197}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {3-540-62559-3}, }