All graphs are set reconstructible if all 2-connected graphs are set reconstructible - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

S. Ramachandran, S. Monikandan. All graphs are set reconstructible if all 2-connected graphs are set reconstructible. Ars Comb., 83, 2007.

@article{RamachandranM07,
  title = {All graphs are set reconstructible if all 2-connected graphs are set reconstructible},
  author = {S. Ramachandran and S. Monikandan},
  year = {2007},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/RamachandranM07},
  cites = {0},
  citedby = {0},
  journal = {Ars Comb.},
  volume = {83},
}

runs on WebDSL