1. Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the 3rd. ACM Symposium on Theory of Computing, pp. 151–158. Association for Computing Machinery, New York (1971)
2. Eades, P., Mendonça, C.F.X.: Heuristics for Planarization by Vertex Splitting. In: Proc. ALCOM Int. Workshop on Graph Drawing, GD 1993, pp. 83–85 (1993)
3. Eades, P., Mendonça, C.F.X.: Vertex Splitting and Tension-Free Layout. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol. 1027, pp. 202–211. Springer, Heidelberg (1996)
4. Faria, L., Figueiredo, C.M.H., Mendonça, C.F.X.: The splitting number of the 4-cube. In: Lucchesi, C.L., Moura, A.V. (eds.) LATIN 1998. LNCS, vol. 1380, pp. 141–150. Springer, Heidelberg (1998)
5. Faria, L., Figueiredo, C.M.H., Mendonça, C.F.X.: Splitting number is NP-Complete, Technical Report ES-443/97, COPPE/UFRJ, Brazil (1997), Available at ftp://ftp.cos.ufrj.br/pub/tech_reps/es44397.ps.gz