2011
DOI: 10.1016/j.disc.2011.03.030
|View full text |Cite
|
Sign up to set email alerts
|

Point sets that minimize (k)-edges, 3-decomposable drawings, and the rectilinear crossing number of K30

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2012
2012
2024
2024

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 10 publications
(2 citation statements)
references
References 9 publications
0
2
0
Order By: Relevance
“…In this work we finally have given the full proof of Theorem 1.2, which was announced at the EuroComb'11 conference [1]. As we mentioned in the Introduction, the exact rectilinear crossing number of K n is known only for n ≤ 27 and n = 30 [3,7,8,9,10]. In [2] and [6] we can find nonisomorphic crossing-minimal rectilinear drawings of K n for both n = 24 and n = 30.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…In this work we finally have given the full proof of Theorem 1.2, which was announced at the EuroComb'11 conference [1]. As we mentioned in the Introduction, the exact rectilinear crossing number of K n is known only for n ≤ 27 and n = 30 [3,7,8,9,10]. In [2] and [6] we can find nonisomorphic crossing-minimal rectilinear drawings of K n for both n = 24 and n = 30.…”
Section: Discussionmentioning
confidence: 99%
“…The exact value of cr(K n ) is known for n ≤ 27 and n = 30 (see [3,7,8,9,10]). The value of cr(K 18 ) = 1029 was established in [8].…”
Section: Introductionmentioning
confidence: 99%