Jirí Fiala, Jan Kratochvíl, Attila Pór. On the computational complexity of partial covers of Theta graphs. Discrete Applied Mathematics, 156(7):1143-1149, 2008. [doi]
@article{FialaKP08,
title = {On the computational complexity of partial covers of Theta graphs},
author = {Jirí Fiala and Jan Kratochvíl and Attila Pór},
year = {2008},
doi = {10.1016/j.dam.2007.05.051},
url = {http://dx.doi.org/10.1016/j.dam.2007.05.051},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/FialaKP08},
cites = {0},
citedby = {0},
journal = {Discrete Applied Mathematics},
volume = {156},
number = {7},
pages = {1143-1149},
}