Alain Cournier, Michel Habib. An Efficient Algorithm to Recognize Prime Undirected Graphs. In Ernst W. Mayr, editor, Graph-Theoretic Concepts in Computer Science, 18th International Workshop, WG 92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings. Volume 657 of Lecture Notes in Computer Science, pages 212-224, Springer, 1992.
@inproceedings{CournierH92,
title = {An Efficient Algorithm to Recognize Prime Undirected Graphs},
author = {Alain Cournier and Michel Habib},
year = {1992},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/CournierH92},
cites = {0},
citedby = {0},
pages = {212-224},
booktitle = {Graph-Theoretic Concepts in Computer Science, 18th International Workshop, WG 92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings},
editor = {Ernst W. Mayr},
volume = {657},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-56402-0},
}