"Solving Computational Problems in the Theory of Word-Representable Graphs."

Özgür Akgün et al. (2019)

> Home

Details and statistics

DOI: —

access: open

type: Journal Article

metadata version: 2020-03-10

- view
  - electronic edition @ uwaterloo.ca (open access)
- export record
  dblp key:
  - journals/jintseq/AkgunGKZ19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jintseq/AkgunGKZ19
Özgür Akgün, Ian P. Gent, Sergey Kitaev, Hans Zantema:
Solving Computational Problems in the Theory of Word-Representable Graphs. J. Integer Seq. 22(2): 19.2.5 (2019)

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.