Linearity is strictly more powerful than contiguity for encoding graphs

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]

Abstract

Abstract is missing.