Author:
Faria L.,de Figueiredo C.M.H.,Mendonça C.F.X.
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference12 articles.
1. S.A. Cook, The complexity of theorem-proving procedures, Proceedings of the Third ACM Symposium on Theory of Computing, New York, 1971, pp. 151–158.
2. P. Eades, C.F.X. Mendonça, Heuristics for planarization by vertex splitting, Proceedings of the ALCOM International Workshop on Graph Drawing, GD’93, 1993, pp. 83–85.
3. P. Eades, C.F.X. Mendonça, Vertex splitting and tension-free layout, Proceedings of the GD’95, Lecture Notes in Computer Science, Vol. 1027, 1996, pp. 202–211.
4. L. Faria, C.M.H. Figueiredo, C.F.X. Mendonça, The splitting number of the 4-cube, Proceedings of the LATIN’98, Lecture Notes in Computer Science, Vol. 1380, 1998, pp. 141–150.
5. The splitting number of the complete graph;Hartfield;Graphs Combin.,1985
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献