1. Axenovich, M., Beveridge, A., Hutchinson, J.P., West, D.B.: Visibility number of directed graphs. SIAM J. Discret. Math. 27(3), 1429–1449 (2013)
2. Babu, J., Basavaraju, M., Chandran, L.S., Rajendraprasad, D., Sivadasan, N.: Approximating the Cubicity of Trees. arXiv:1402.6310 [cs.DM]
3. Bose, P., Dean, A., Hutchinson, J., Shermer, T.: On rectangle visibility graphs. In: North, S. (ed.) Lecture Notes in Computer Science 1190: Graph Drawing, pp. 25–44. Springer, Berlin (1997)
4. Buneman, P.: A characterisation of rigid circuit graphs. Discret. Math. 9, 205–212 (1974)
5. Chang, Y., Hutchinson, J.P., Jacobson, M.S., Lehel, J., West, D.B.: The bar visibility number of a graph. SIAM J. Discret. Math. 18(3), 462–471 (2004)