The splitting number of the 4-cube

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

Volumn 1380, Issue , 1998, Pages 141-150

  Faria, Luerbio ^a,b   Figueiredo, Celina Miraglia Herrera De ^b   Mendonça Neto, Candido Ferreira Xavier De ^c  

^a STATE UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^b FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^c UNIVERSITY OF CAMPINAS   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY;

GRAPH G; LOWER BOUNDS; NONADJACENT VERTICES; PLANAR GRAPH; SPLITTING NUMBER;

GEOMETRY;

EID: 84949237169     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0054317     Document Type: Conference Paper

References (22)

1. M. S. Anderson, R. B. Richter and P. Rodney (1996). "The crossing number of C6 x C6", Congressus Numerantium 118, 97-107.
2. M. S. Anderson, R. B. Richter and P. Rodney (1997). "The crossing number of C7 x C7". Proe. 28th Southeastern Conference on Combinatorics, Graph Theory and Computing, Boca Raton, Florida, USA.
3. R. J. Cimikowski (1992). "Graph planarization and skewness", Congressus Numerantium 88, 21-32.
4. A. M. Dean and R. B. Richter (1995). "The crossing number of C4 x C4", Journal of Graph Theory 19, 125-129.
5. P. Eades and C. F. X. Mendonçja (1993). "Heuristics for Planarization by Vertex Splitting". Proc. ALCOM Int. Workshop on Graph Drawing, GD'93, 83-85.
6. P. Eades and C. F. X. Mendonça (1996). "Vertex Splitting and Tension-Free Layout". Proc. GD'95, Lecture Notes in Computer Science 1027, 202-211.
7. R. B. Eggleton and R. P. Guy (1970). "The crossing number of the n-cube", AMS Notices 17, 757.
8. L. Faria (1994). "Bounds for the crossing number of the n-cube", Master thesis, Universidade Federal do Rio de Janeiro (In Portuguese).
9. L. Faria and C. M. H. Figueiredo (1997). "On the Eggleton and Guy conjectured upper bound for the crossing number of the n-cube", submitted to Math. Slovaca
10. L. Faria, C. M. H. Figueiredo and C. F. X. Mendonqa (1997). "Splitting number is NP-Complete", Technical Report ES-443/97, COPPE/UFRJ, Brazil.
11. M. R. Garey and D. S. Johnson (1983). "Crossing number is NP-complete", SIAM J. Algebraic and Discrete Methods 4, 312-316.
12. F. Harary, P. C. Kainen and A. J. Schwenk (1973). "Toroidal graphs with arbitrarily high crossing number", Nanta Math. 6, 58-67.
13. N. Hartfield, B. Jackson and G. Ringel (1985). "The splitting number of the complete graph", Graphs and Combinatorics 1, 311-329.
14. B. Jackson and G. Ringel (1984). "The splitting number of complete bipartite graphs", Arch. Math. 42, 178-184.
15. K. Kuratowski (1930). "Sur le probléme des courbes gauches en topologie", Fundamenta Mathematicae 15, 271-283.
16. F.T. Leighton (1981). "New lower bound techniques for VLSr', Proe. Z2nd Annual Symposium on Foundations of Computer Science, Long Beach CA, 1-12.
17. A. Liebers (1996). "Methods for Planarizing Graphs - A Survey and Annotated Bibliography", ftp://ftp.informatik.uni-konstanz.de/pub /preprints/1996 /preprint-012.ps.Z.
18. P. C. Liu and R. C. Geldmacher (1979). "On the deletion of nonplanar edges of a graph", Congressus Numerantium 24, 727-738.
19. T. Madej (1991). "Bounds for the crossing number of the n-cube", Journal of Graph Theory 15, 81-97.
20. C. F. X. Mendonça (1994). "A Layout System for Information System Diagrams", Ph.D. thesis, University of Queensland, Australia.
21. R. D. Ringeisen and L. W. Beineke (1978). "The crossing number of C3xCn", Journal of Combinatorial Theory Ser. B 24, 134-136.
22. O. Sýkora and I. Vrťo (1993). "On the crossing number of hypercubes and cube connected cycles", BIT 33, 232-237.