Splitting number is NP-complete

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1517, Issue , 1998, Pages 285-297

  Faria, L ^a   de Figueiredo, C M H ^a   Mendonca C F X ^b  

^a FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^b UNIVERSITY OF CAMPINAS   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS; POLYNOMIALS;

CUBIC GRAPH; DECISION PROBLEMS; MAXIMUM PLANAR SUBGRAPH; NONADJACENT VERTICES; NP COMPLETE; NP-COMPLETENESS; PLANAR GRAPH; SPLITTING NUMBER;

GRAPH THEORY;

EID: 84947910248     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10692760_23     Document Type: Conference Paper

References (12)

1. S. A. Cook (1971). "The complexity of theorem-proving procedures", Proceedings of the 3rd. ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, 151-158.
2. P. Eades and C. F. X. Mendonca (1993). "Heuristics for Planarization by Vertex Splitting". Proc. ALCOM Int. Workshop on Graph Drawing, GD'93, 83-85.
3. P. Eades and C. F. X. Mendonca (1996). "Vertex Splitting and Tension-Free Layout". Proc. GD'95, Lecture Notes in Computer Science 1027, 202-211.
4. L. Faria, C. M. H. Figueiredo and C. F. X. Mendonca (1998). "The splitting number of the 4-cube", Proc. LATIN'98, Lecture Notes in Computer Science 1380, 141150.
5. L. Faria, C. M. H. Figueiredo and C. F. X. Mendoncca (1997). "Splitting number is NP-Complete", Technical Report ES-443/97, COPPE/UFRJ, Brazil. Available at ftp://ftp.cos.ufrj.br/pub/tech_reps/es44397.ps.gz.
6. N. Hartfield, B. Jackson and G. Ringel (1985). "The splitting number of the complete graph", Graphs and Combinatorics 1, 311-329.
7. J. E. Hopcroft and R. E. Tarjan (1974). "Efficient Planarity Testing", J. ACM 21, 549-568.
8. B. Jackson and G. Ringel (1984). "The splitting number of complete bipartite graphs", Arch. Math. 42, 178-184.
9. K. Kuratowski (1930). "Sur le probleme des courbes gauches en topologie", Fund. Math. 15, 271-283.
10. A. Liebers (1996). "Methods for Planarizing Graphs - A Survey and Annotated Bibliography". Available at ftp://ftp.informatik.uni-konstanz.de/pub/preprints//1996/preprint-012.ps.Z.
11. P. C. Liu and R. C. Geldmacher (1979). "On the deletion of nonplanar edges of a graph", Cong. Num. 24, 727-738.
12. C. F. X. Mendonca (1994). "A Layout System for Information System Diagrams", PhD thesis, Univ. of Queensland, Australia.