-
1
-
-
84867987851
-
-
University of Vermont Web Server
-
D. Archdeacon, The rectilinear crossing number. http://www.emba.uvm.edu/ ̃archdeac/problems/rectcros.htm, 1995. University of Vermont Web Server.
-
(1995)
The Rectilinear Crossing Number
-
-
Archdeacon, D.1
-
2
-
-
51249175187
-
Some provably hard crossing number problems
-
D. Bienstock, Some provably hard crossing number problems, Discrete Comput. Geom. 6(5) (1991) 443-459.
-
(1991)
Discrete Comput. Geom.
, vol.6
, Issue.5
, pp. 443-459
-
-
Bienstock, D.1
-
3
-
-
84987492877
-
New results on rectilinear crossing numbers and plane embeddings
-
D. Bienstock, N. Dean, New results on rectilinear crossing numbers and plane embeddings, J. Graph Theory 16(5) (1992) 389-398.
-
(1992)
J. Graph Theory
, vol.16
, Issue.5
, pp. 389-398
-
-
Bienstock, D.1
Dean, N.2
-
4
-
-
84987564484
-
Bounds for rectilinear crossing numbers
-
D. Bienstock, N. Dean, Bounds for rectilinear crossing numbers, J. Graph Theory 17(3) (1993) 333-348.
-
(1993)
J. Graph Theory
, vol.17
, Issue.3
, pp. 333-348
-
-
Bienstock, D.1
Dean, N.2
-
10
-
-
0042825605
-
Numbers of nonisomorphic drawings for small graphs
-
H.D.O.F. Gronau, H. Harborth, Numbers of nonisomorphic drawings for small graphs, Congr. Numer. 71 (1990) 105-114.
-
(1990)
Congr. Numer.
, vol.71
, pp. 105-114
-
-
Gronau, H.D.O.F.1
Harborth, H.2
-
12
-
-
0010242021
-
Crossing numbers of graphs
-
Graph Theory and Applications (Proceedings of the Conference Western Michigan University, Kalamazoo, MI, 1972; dedicated to the memory of J.W.T. Youngs) Springer, Berlin
-
R.K. Guy, Crossing numbers of graphs, in: Graph Theory and Applications (Proceedings of the Conference, Western Michigan University, Kalamazoo, MI, 1972; dedicated to the memory of J.W.T. Youngs), Lecture Notes in Mathematics, Vol. 303, Springer, Berlin, 1972, pp. 111-124.
-
(1972)
Lecture Notes in Mathematics
, vol.303
, pp. 111-124
-
-
Guy, R.K.1
-
13
-
-
0347122877
-
Number of edges without crossings in rectilinear drawings of the complete graph
-
H. Harborth, C. ThXurmann, Number of edges without crossings in rectilinear drawings of the complete graph, Congr. Numer. 119 (1996) 76-83.
-
(1996)
Congr. Numer.
, vol.119
, pp. 76-83
-
-
Harborth, H.1
Thxurmann, C.2
-
14
-
-
0000391389
-
A lower bound for the optimal crossing-free hamiltonian cycle problem
-
R.B. Hayward, A lower bound for the optimal crossing-free Hamiltonian cycle problem, Discrete Comput. Geom. 2 (1987) 327-343.
-
(1987)
Discrete Comput. Geom.
, vol.2
, pp. 327-343
-
-
Hayward, R.B.1
-
15
-
-
0348023369
-
An upper bound for the rectilinear crossing number of the complete graph
-
H.F. Jensen, An upper bound for the rectilinear crossing number of the complete graph, J. Combin. Theory Ser. B 10 (1971) 212-216.
-
(1971)
J. Combin. Theory Ser. B
, vol.10
, pp. 212-216
-
-
Jensen, H.F.1
-
17
-
-
0013553411
-
Optimal crossing-free Hamiltonian circuit drawings of Kn
-
M. Newborn, W.O.J. Moser, Optimal crossing-free Hamiltonian circuit drawings of Kn, J. Combin. Theory Ser. B 29(1) (1980) 13-26.
-
(1980)
J. Combin. Theory Ser. B
, vol.29
, Issue.1
, pp. 13-26
-
-
Newborn, M.1
Moser, W.O.J.2
-
18
-
-
0032643131
-
New bounds on crossing numbers
-
Miami, Florida ACM Press, New York
-
J. Pach, J. Spencer, G. TYoth, New bounds on crossing numbers, in: Proceedings of the 15th annual symposium on Computational Geometry, Miami, Florida, ACM Press, New York, 1999, pp. 124-133.
-
(1999)
Proceedings of the 15th Annual Symposium on Computational Geometry
, pp. 124-133
-
-
Pach, J.1
Spencer, J.2
Tyoth, G.3
-
19
-
-
0010249478
-
Thirteen problems on crossing numbers
-
J. Pach, G. TYoth, Thirteen problems on crossing numbers, Geombinatorics 9(4) (2000) 195-207.
-
(2000)
Geombinatorics
, vol.9
, Issue.4
, pp. 195-207
-
-
Pach, J.1
Tyoth, G.2
-
20
-
-
21844519141
-
The rectilinear crossing number of a complete graph and sylvester's "four point problem" of geometric probability
-
E.R. Scheinerman, H.S. Wilf, The rectilinear crossing number of a complete graph and Sylvester's "four point problem" of geometric probability, Amer. Math. Monthly 101 (1994) 939-943.
-
(1994)
Amer. Math. Monthly
, vol.101
, pp. 939-943
-
-
Scheinerman, E.R.1
Wilf, H.S.2
-
22
-
-
0030478525
-
A parallel stochastic optimization algorithm for 8nding mappings of the rectilinear minimal crossing problem
-
J.T. Thorpe, F.C. Harris, Jr, A parallel stochastic optimization algorithm for 8nding mappings of the rectilinear minimal crossing problem, Ars Combinatoria 43 (1996) 135-148.
-
(1996)
Ars Combinatoria
, vol.43
, pp. 135-148
-
-
Thorpe, J.T.1
Harris Jr., F.C.2
-
23
-
-
0002602647
-
Topological graph theory
-
L.W. Beineke, R.J. Wilson (Eds.) Academic Press, New York
-
A.T. White, W. Beineke, Topological graph theory, in: L.W. Beineke, R.J. Wilson (Eds.), Selected Topics in Graph Theory, Academic Press, New York, 1978, pp. 15-49.
-
(1978)
Selected Topics in Graph Theory
, pp. 15-49
-
-
White, A.T.1
Beineke, W.2
-
24
-
-
0010251536
-
On crossing numbers, and some unsolved problems
-
B. BollobYas, A.G. Thomason (Eds.) Cambridge 1993, Cambridge University Press, Cambridge
-
H.S. Wilf, On crossing numbers, and some unsolved problems, in: B. BollobYas, A.G. Thomason (Eds.), Combinatorics, Geometry and Probability, Cambridge, 1993, Cambridge University Press, Cambridge, 1997, pp. 557-562.
-
(1997)
Combinatorics, Geometry and Probability
, pp. 557-562
-
-
Wilf, H.S.1
|