"Undirected graphs rearrangeable by 2-length walks."

Dominique Barth, Petrisor Panaite (1998)

> Home

Details and statistics

DOI: 10.1002/(SICI)1097-0037(199807)31:4<239::AID-NET4>3.0.CO;2-E

access: closed

type: Journal Article

metadata version: 2017-05-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/networks/BarthP98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/BarthP98
Dominique Barth, Petrisor Panaite:
Undirected graphs rearrangeable by 2-length walks. Networks 31(4): 239-247 (1998)

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.