1. Lecture Notes in Computer Science;H.L. Chen,2002
2. Chiang, Y.T., Lin, C.C., Lu, H.I.: Orderly spanning trees with applications to graph encoding and graph drawing. In: Proc. 12th Annual ACM-SIAM Symp. on Discrete Algorithms, pp. 506-515 (2001)
3. Chiba, N., Onoguchi, K., Nishizeki, T.: Drawing planar graphs nicely. Acta Inform. 22, 187–201 (1985)
4. Chiba, N., Yamanouchi, T., Nishizeki, T.: Linear algorithms for convex drawings of planar graphs. In: Bondy, J.A., Murty, U.S.R. (eds.) Progress in Graph Theory, pp. 153–173. Academic Press, London (1984)
5. Chrobak, M., Kant, G.: Convex grid drawings of 3-connected planar graphs. International Journal of Computational Geometry and Applications 7, 211–223 (1997)