"On computational complexity of length embeddability of graphs."

Mikhail Tikhomirov (2016)

> Home

Details and statistics

DOI: 10.1016/J.DISC.2016.05.011

access: open

type: Journal Article

metadata version: 2021-02-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dm/Tikhomirov16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/Tikhomirov16
Mikhail Tikhomirov:
On computational complexity of length embeddability of graphs. Discret. Math. 339(11): 2605-2612 (2016)

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.