"A characterization of biconnected graphs reachable by robots jumping over ..."

Biswajit Deb (2017)

> Home

Details and statistics

DOI: 10.1016/J.ENDM.2017.11.012

access: closed

type: Journal Article

metadata version: 2023-09-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/endm/Deb17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/endm/Deb17
Biswajit Deb:
A characterization of biconnected graphs reachable by robots jumping over m obstacles. Electron. Notes Discret. Math. 63: 177-187 (2017)

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.