Johann A. Makowsky, Udi Rotics, Ilya Averbouch, Benny Godlin. Computing Graph Polynomials on Graphs of Bounded Clique-Width. In Fedor V. Fomin, editor, Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006, Bergen, Norway, June 22-24, 2006, Revised Papers. Volume 4271 of Lecture Notes in Computer Science, pages 191-204, Springer, 2006. [doi]
@inproceedings{MakowskyRAG06,
title = {Computing Graph Polynomials on Graphs of Bounded Clique-Width},
author = {Johann A. Makowsky and Udi Rotics and Ilya Averbouch and Benny Godlin},
year = {2006},
doi = {10.1007/11917496_18},
url = {http://dx.doi.org/10.1007/11917496_18},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/MakowskyRAG06},
cites = {0},
citedby = {0},
pages = {191-204},
booktitle = {Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006, Bergen, Norway, June 22-24, 2006, Revised Papers},
editor = {Fedor V. Fomin},
volume = {4271},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-48381-0},
}