Two counterexamples in graph drawing

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

Volumn 2573 LNCS, Issue , 2002, Pages 391-398

  Sykora O ^a   Szekely L A ^b   Vrt'o, I ^c  

^a LOUGHBOROUGH UNIVERSITY   (United Kingdom)

^b UNIVERSITY OF SOUTH CAROLINA   (United States)

^c INSTITUTE OF CHEMISTRY   (Slovakia)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS);

CROSSING NUMBER; GRAPH DRAWING; LINEAR ARRANGEMENTS; MAXIMUM DEGREE; UPPER BOUND;

GRAPH THEORY;

EID: 26144439548     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36379-3_34     Document Type: Conference Paper

References (14)

1. Aggarwal, A., Klawe, M., Shor, P.: Multi-Layer Grid Embeddings for VLSI. Algorithmica 6 (1991) 129-151
2. Beineke, L. W.: Biplanar Graphs: A Survey. Computers and Mathematics with Applications 34 (1997) 1-8
3. Beineke, L. W., Harary, F., Moon, W.: On the Thickness of the Complete Bipartite Graph. Proc. Cambridge Philosophical Society 60 (1964) 1-5
4. Chung, F. R. K., Tetali, P.: Isoperimetric Inequalities for Cartesian Products of Graphs. Combinatorics, Probability and Computing 7 (1998) 141-148
5. Denise, A., Vasconcellos, M., Welsh, D.: The Random Planar Graphs. Congressus Numerantium 113 (1996) 61-79.
6. Even, G., Guha, S., Schieber, B.: Improved Approximations of Crossings in Graph Drawing. In: 32th Annual Symposium on Theory of Computing. ACM Press (2000)
7. Halton, J. H.: On the Thickness of Graphs of Given Degree. Information Sciences54 (1991) 219-238
8. Mansfield, A.: Determining the Thickness of Graphs is NP-hard. Mathematical Proceedings of Combridge Philosohical Society 93 (1983) 9-23
9. McKay, B. D.: Asymptotics for Symmetries 0-1 Matrices with Prescribed Row Sums. Ars Combinatoria 19 (1985) 15-25
10. Mutzel, P., Odenthal, T., Scharbrodt, M.: The Thickness of Graphs: A Survey. Graphs and Combinatorics 14 (1998) 59-73
11. Owen, A.: The Biplanar Crossing Number. IEEE Transactions on Circuit Theory 18 (1971) 277-280
12. Shahrokhi, F.: Open Problem Presented at Special Session on Combinatorics and Graph Theory. 963 Sectional Meeting of AMS. Columbia SC. March 16-18 (2001)
13. Shahrokhi, F., Sýkora, O., Székely, L.A., Vrt'o, I.: On Bipartite Drawings and the Linear Arrangement Problem. SIAM J. Computing 30 (2001) 1773-1789
14. Wessel, W.: Über die Abhängigkeit der Dicke eines Graphen von seinen Knotenpunktvalenzen. In: Geometrie und Kombinatorik'83. Vol. 2. Karl-Marx-Stadt Uni. (1984) 235-238