The Complexity of Domination Problems in Circle Graphs

J. Mark Keil. The Complexity of Domination Problems in Circle Graphs. Discrete Applied Mathematics, 42(1):51-63, 1993. [doi]

@article{Keil93,
  title = {The Complexity of Domination Problems in Circle Graphs},
  author = {J. Mark Keil},
  year = {1993},
  doi = {10.1016/0166-218X(93)90178-Q},
  url = {http://dx.doi.org/10.1016/0166-218X(93)90178-Q},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Keil93},
  cites = {0},
  citedby = {0},
  journal = {Discrete Applied Mathematics},
  volume = {42},
  number = {1},
  pages = {51-63},
}