-
1
-
-
0026177615
-
Complexities of layouts in three-dimensional VLSI circuits
-
Aboelaze M.A., Wah B.W. Complexities of layouts in three-dimensional VLSI circuits. Inform. Sci. 55(1-3):1991;167-188.
-
(1991)
Inform. Sci.
, vol.55
, Issue.1-3
, pp. 167-188
-
-
Aboelaze, M.A.1
Wah, B.W.2
-
2
-
-
0026082425
-
Multilayer grid embeddings for VLSI
-
Aggarwal A., Klawe M., Shor P. Multilayer grid embeddings for VLSI. Algorithmica. 6(1):1991;129-151.
-
(1991)
Algorithmica
, vol.6
, Issue.1
, pp. 129-151
-
-
Aggarwal, A.1
Klawe, M.2
Shor, P.3
-
3
-
-
0004542029
-
Thickness of arbitrary complete graphs
-
Alekseev V.B., Gonchakov V.S. Thickness of arbitrary complete graphs. Mat. Sb. 101:1976;212-230.
-
(1976)
Mat. Sb.
, vol.101
, pp. 212-230
-
-
Alekseev, V.B.1
Gonchakov, V.S.2
-
4
-
-
0040794967
-
The thickness of the complete graph
-
Beineke L.W., Harary F. The thickness of the complete graph. Canad. J. Math. 17:1965;850-859.
-
(1965)
Canad. J. Math.
, vol.17
, pp. 850-859
-
-
Beineke, L.W.1
Harary, F.2
-
5
-
-
0040200590
-
The decomposition of complete graphs into planar subgraphs
-
F. Harary. New York: Academic Press
-
Beineke L.W. The decomposition of complete graphs into planar subgraphs. Harary F. Graph Theory and Theoretical Physics. 1967;139-154 Academic Press, New York.
-
(1967)
Graph Theory and Theoretical Physics
, pp. 139-154
-
-
Beineke, L.W.1
-
6
-
-
0031354729
-
Biplanar graphs: A survey
-
Beineke L.W. Biplanar graphs. a survey Comput. Math. Appl. 34(11):1997;1-8.
-
(1997)
Comput. Math. Appl.
, vol.34
, Issue.11
, pp. 1-8
-
-
Beineke, L.W.1
-
10
-
-
0344095524
-
Relations among embedding parameters for graphs
-
Wiley, New York
-
A.M. Dean, J.P. Hutchinson, Relations among embedding parameters for graphs, in: Graph Theory, Combinatorics, and Applications, Vol. 1, Wiley, New York, 1991, pp. 287-296.
-
(1991)
Graph Theory, Combinatorics, and Applications
, vol.1
, pp. 287-296
-
-
Dean, A.M.1
Hutchinson, J.P.2
-
13
-
-
0001387789
-
A decomposition theorem for partially ordered sets
-
Dilworth R.P. A decomposition theorem for partially ordered sets. Ann. Math. 51(2):1950;161-166.
-
(1950)
Ann. Math.
, vol.51
, Issue.2
, pp. 161-166
-
-
Dilworth, R.P.1
-
14
-
-
84867482161
-
Separating thickness from geometric thickness
-
M.T. Goodrich, & S.G. Kobourov. Proceedings of the 10th International Symposium on Graph Drawing (GD '02) Berlin: Springer
-
Eppstein D. Separating thickness from geometric thickness. Goodrich M.T., Kobourov S.G. Proceedings of the 10th International Symposium on Graph Drawing (GD '02). Lecture Notes in Computer Science. Vol. 2528:2002;150-161 Springer, Berlin.
-
(2002)
Lecture Notes in Computer Science
, vol.2528
, pp. 150-161
-
-
Eppstein, D.1
-
15
-
-
0001567493
-
On straight line representation of planar graphs
-
Fáry I. On straight line representation of planar graphs. Acta Univ. Szeged. Sect. Sci. Math. 11:1948;229-233.
-
(1948)
Acta Univ. Szeged. Sect. Sci. Math.
, vol.11
, pp. 229-233
-
-
Fáry, I.1
-
16
-
-
0026147819
-
On the thickness of graphs of given degree
-
Halton J.H. On the thickness of graphs of given degree. Inform. Sci. 54(3):1991;219-238.
-
(1991)
Inform. Sci.
, vol.54
, Issue.3
, pp. 219-238
-
-
Halton, J.H.1
-
17
-
-
0026931094
-
Laying out graphs using queues
-
Heath L.S., Rosenberg A.L. Laying out graphs using queues. SIAM J. Comput. 21(5):1992;927-958.
-
(1992)
SIAM J. Comput.
, vol.21
, Issue.5
, pp. 927-958
-
-
Heath, L.S.1
Rosenberg, A.L.2
-
18
-
-
0042709989
-
On representations of some thickness-two graphs
-
Hutchinson J.P., Shermer T., Vince A. On representations of some thickness-two graphs. Comput. Geom. 13(3):1999;161-171.
-
(1999)
Comput. Geom.
, vol.13
, Issue.3
, pp. 161-171
-
-
Hutchinson, J.P.1
Shermer, T.2
Vince, A.3
-
19
-
-
0344095525
-
Thickness and coarseness of graphs
-
Kainen P.C. Thickness and coarseness of graphs. Abh. Math. Sem. Univ. Hamburg. 39:1973;88-95.
-
(1973)
Abh. Math. Sem. Univ. Hamburg
, vol.39
, pp. 88-95
-
-
Kainen, P.C.1
-
21
-
-
38149146031
-
Genus g graphs have pagenumber O(√g)
-
Malitz S.M. Genus. g graphs have pagenumber O(√g) J. Algorithms. 17(1):1994;85-109.
-
(1994)
J. Algorithms
, vol.17
, Issue.1
, pp. 85-109
-
-
Malitz, S.M.1
-
22
-
-
0346834702
-
Graphs with E edges have pagenumber O(√E)
-
Malitz S.M. Graphs with. E edges have pagenumber O(√E) J. Algorithms. 17(1):1994;71-84.
-
(1994)
J. Algorithms
, vol.17
, Issue.1
, pp. 71-84
-
-
Malitz, S.M.1
-
25
-
-
0002470563
-
A remark on Stirling's formula
-
Robbins H. A remark on Stirling's formula. Amer. Math. Monthly. 62:1955;26-29.
-
(1955)
Amer. Math. Monthly
, vol.62
, pp. 26-29
-
-
Robbins, H.1
-
26
-
-
0003062211
-
On crossing sets, disjoint sets, and pagenumber
-
Shahrokhi F., Shi W. On crossing sets, disjoint sets, and pagenumber. J. Algorithms. 34(1):2000;40-53.
-
(2000)
J. Algorithms
, vol.34
, Issue.1
, pp. 40-53
-
-
Shahrokhi, F.1
Shi, W.2
-
27
-
-
0001855349
-
Bemerkung zum Vierfarbenproblem
-
Wagner K. Bemerkung zum Vierfarbenproblem. Jber. Deutsch. Math.-Verein. 46:1936;26-32.
-
(1936)
Jber. Deutsch. Math.-verein.
, vol.46
, pp. 26-32
-
-
Wagner, K.1
-
28
-
-
0037235097
-
Degree constrained book embeddings
-
Wood D.R. Degree constrained book embeddings. J. Algorithms. 45(2):2002;144-154.
-
(2002)
J. Algorithms
, vol.45
, Issue.2
, pp. 144-154
-
-
Wood, D.R.1
|