Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs

Ryuhei Uehara, Seinosuke Toda, Takayuki Nagoya. Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs. Discrete Applied Mathematics, 145(3):479-482, 2005. [doi]

@article{UeharaTN05,
  title = {Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs},
  author = {Ryuhei Uehara and Seinosuke Toda and Takayuki Nagoya},
  year = {2005},
  doi = {10.1016/j.dam.2004.06.008},
  url = {http://dx.doi.org/10.1016/j.dam.2004.06.008},
  tags = {completeness, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/UeharaTN05},
  cites = {0},
  citedby = {0},
  journal = {Discrete Applied Mathematics},
  volume = {145},
  number = {3},
  pages = {479-482},
}