"Linearity is strictly more powerful than contiguity for encoding graphs."

Christophe Crespelle et al. (2016)

> Home

Details and statistics

DOI: 10.1016/J.DISC.2016.03.006

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/CrespelleLPP16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/CrespelleLPP16
Christophe Crespelle, Tien-Nam Le, Kévin Perrot, Thi Ha Duong Phan:
Linearity is strictly more powerful than contiguity for encoding graphs. Discret. Math. 339(8): 2168-2177 (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.