"All graphs are set reconstructible if all 2-connected graphs are set ..."

S. Ramachandran, S. Monikandan (2007)

> Home

Details and statistics

DOI: —

access: unavailable

type: Journal Article

metadata version: 2008-11-28

- no documents available
- export record
  dblp key:
  - journals/arscom/RamachandranM07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/arscom/RamachandranM07
S. Ramachandran, S. Monikandan:
All graphs are set reconstructible if all 2-connected graphs are set reconstructible. Ars Comb. 83 (2007)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.