Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs

Martin Grohe. Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs. In Andreas Blass, Nachum Dershowitz, Wolfgang Reisig, editors, Fields of Logic and Computation, Essays Dedicated to Yuri Gurevich on the Occasion of His 70th Birthday. Volume 6300 of Lecture Notes in Computer Science, pages 328-353, Springer, 2010. [doi]

@inproceedings{Grohe10,
  title = {Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs},
  author = {Martin Grohe},
  year = {2010},
  doi = {10.1007/978-3-642-15025-8_17},
  url = {http://dx.doi.org/10.1007/978-3-642-15025-8_17},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Grohe10},
  cites = {0},
  citedby = {0},
  pages = {328-353},
  booktitle = {Fields of Logic and Computation, Essays Dedicated to Yuri Gurevich on the Occasion of His 70th Birthday},
  editor = {Andreas Blass and Nachum Dershowitz and Wolfgang Reisig},
  volume = {6300},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-15024-1},
}