Isomorphism of Graphs of Bounded Valence can be Tested in Polynomial Time - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Eugene M. Luks. Isomorphism of Graphs of Bounded Valence can be Tested in Polynomial Time. J. Comput. Syst. Sci., 25(1):42-65, 1982.

@article{Luks82,
  title = {Isomorphism of Graphs of Bounded Valence can be Tested in Polynomial Time},
  author = {Eugene M. Luks},
  year = {1982},
  tags = {testing, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Luks82},
  cites = {0},
  citedby = {0},
  journal = {J. Comput. Syst. Sci.},
  volume = {25},
  number = {1},
  pages = {42-65},
}

runs on WebDSL