On the Decidability of Integer Subgraph Problems on Context-Free Graph Languages

Egon Wanke. On the Decidability of Integer Subgraph Problems on Context-Free Graph Languages. In Lothar Budach, editor, Fundamentals of Computation Theory, 8th International Symposium, FCT 91, Gosen, Germany, September 9-13, 1991, Proceedings. Volume 529 of Lecture Notes in Computer Science, pages 415-426, Springer, 1991.

@inproceedings{Wanke91,
  title = {On the Decidability of Integer Subgraph Problems on Context-Free Graph Languages},
  author = {Egon Wanke},
  year = {1991},
  tags = {graph-rewriting, context-aware, rewriting},
  researchr = {https://researchr.org/publication/Wanke91},
  cites = {0},
  citedby = {0},
  pages = {415-426},
  booktitle = {Fundamentals of Computation Theory, 8th International Symposium, FCT  91, Gosen, Germany, September 9-13, 1991, Proceedings},
  editor = {Lothar Budach},
  volume = {529},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-54458-5},
}