Searching for "On the Crossing Number of Complete Graphs." – sorted by Relevance.
41 documents found, showing 1 through 10.
Next 10 →
-
On the crossing numbers of complete graphs
- …On the Crossing Numbers of Complete Graphs by Shengjun Pan A thesis presented to the University…
- Cited by 1 (1 self) – Add To MetaCart
-
On the Rectilinear Crossing Number of Complete Graphs
- …On the Rectilinear Crossing Number of Complete Graphs Technical Report no. 372, ETH Zurich, Dept…
- Cited by 7 (1 self) – Add To MetaCart
-
On the crossing number of complete graphs: Growing minimal kn from minimal kn−1
- …University of Nevada Reno On the Crossing Number of Complete Graphs: Growing Minimal Kn From…
- Cited by 2 (0 self) – Add To MetaCart
-
Implementatations of Algorithms For Line-Segment Intersection
- … to determine the rectilinear crossing number of complete graphs. 1 Introduction The problem of finding all…
- Add To MetaCart
-
The Rectilinear Crossing Number of a Complete Graph and Sylvester's "Four Point Problem
- …The Rectilinear Crossing Number of a Complete Graph and Sylvester's "Four Point Problem…
- Cited by 18 (0 self) – Add To MetaCart
-
Convex Quadrilaterals and k-Sets
- … number of the complete n-graph Kn, i.e., to determine the minimum number of crossings in a drawing of Kn…
- Cited by 14 (0 self) – Add To MetaCart
-
Toward the Rectilinear Crossing Number of Kn
- … embeddings is to determine the rectilinear crossing number of the complete graph Kn.” A rectilinear drawing…
- Cited by 18 (1 self) – Add To MetaCart
-
Toward the Rectilinear Crossing Number of K n : New Embeddings, Upper Bounds, and Asymptotics
- … number of the complete graph Kn ." A rectilinear embedding or drawing of Kn is an arrangement of n…
- Cited by 3 (1 self) – Add To MetaCart
-
On (≤ k)-pseudoedges in generalized configurations and the pseudolinear crossing number of K_n
- … numbers of the complete graph Kn are different for every n ≥ 10. It has been noted that all known optimal…
- Cited by 5 (4 self) – Add To MetaCart
-
Thirteen Problems on Crossing Numbers
- …'s classical conjecture about crossing numbers of complete bipartite graphs, the last ones are new and less…
- Cited by 10 (0 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
