Christophe Crespelle, Tien-Nam Le, Kévin Perrot, Thi Ha Duong Phan. Linearity is strictly more powerful than contiguity for encoding graphs. Discrete Mathematics, 339(8):2168-2177, 2016. [doi]
@article{CrespelleLPP16,
title = {Linearity is strictly more powerful than contiguity for encoding graphs},
author = {Christophe Crespelle and Tien-Nam Le and Kévin Perrot and Thi Ha Duong Phan},
year = {2016},
doi = {10.1016/j.disc.2016.03.006},
url = {http://dx.doi.org/10.1016/j.disc.2016.03.006},
researchr = {https://researchr.org/publication/CrespelleLPP16},
cites = {0},
citedby = {0},
journal = {Discrete Mathematics},
volume = {339},
number = {8},
pages = {2168-2177},
}