The Optimal Cost Chromatic Partition Problem for Trees and Interval Graphs

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.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.