Martin Charles Golumbic, Udi Rotics. On the Clique-Width of Perfect Graph Classes. In Peter Widmayer, Gabriele Neyer, Stephan Eidenbenz, editors, Graph-Theoretic Concepts in Computer Science, 25th International Workshop, WG 99, Ascona, Switzerland, June 17-19, 1999, Proceedings. Volume 1665 of Lecture Notes in Computer Science, pages 135-147, Springer, 1999. [doi]
@inproceedings{GolumbicR99,
title = {On the Clique-Width of Perfect Graph Classes},
author = {Martin Charles Golumbic and Udi Rotics},
year = {1999},
url = {http://link.springer.de/link/service/series/0558/bibs/1665/16650135.htm},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/GolumbicR99},
cites = {0},
citedby = {0},
pages = {135-147},
booktitle = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop, WG 99, Ascona, Switzerland, June 17-19, 1999, Proceedings},
editor = {Peter Widmayer and Gabriele Neyer and Stephan Eidenbenz},
volume = {1665},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-66731-8},
}