1. Barbay J, Castelli Aleardi L, He M, Munro JI (2012) Succinct representation of labeled graphs. Algorithmica 62(1–2):224–257
2. Blandford DK, Blelloch GE, Kash IA (2003) Compact representations of separable graphs. In: SODA, ACM/SIAM, pp 679–688
3. Blelloch GE, Farzan A (2010) Succinct representations of separable graphs. In: Amir A, Parida L (eds) CPM. Lecture notes in computer science, vol 6129. Springer, Berlin/New York, pp 138–150
4. Brightwell G, Goodall S (1996) The number of partial orders of fixed width. Order 13(4):315–337. doi:10.1007/BF00405592,
http://dx.doi.org/10.1007/BF00405592
5. Castelli Aleardi L, Devillers O, Schaeffer G (2005) Succinct representation of triangulations with a boundary. In: Dehne FKHA, López-Ortiz A, Sack JR (eds) WADS. Lecture notes in computer science, vol 3608. Springer, Berlin/New York, pp 134–145