On the crossing number of complete graphs (Q817025): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00607-005-0133-3 / rank
Normal rank
 
Property / author
 
Property / author: Oswin Aichholzer / rank
Normal rank
 
Property / author
 
Property / author: Franz Aurenhammer / rank
Normal rank
 
Property / author
 
Property / author: Hannes Krasser / rank
Normal rank
 
Property / author
 
Property / author: Oswin Aichholzer / rank
 
Normal rank
Property / author
 
Property / author: Franz Aurenhammer / rank
 
Normal rank
Property / author
 
Property / author: Hannes Krasser / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00607-005-0133-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1990000829 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the rectilinear crossing number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating order types for small point sets with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the crossing number of complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract order type extension and new results on the rectilinear crossing number / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-sets, convex quadrilaterals, and the rectilinear crossing number of \(K_{n}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some provably hard crossing number problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rectilinear crossing number of \(K_{10}\) is 62 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward the rectilinear crossing number of \(K _{n}\): New drawings, upper bounds, and asymptotics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing Number Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing Number is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multidimensional Sorting / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Crossings in a Complete Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the optimal crossing-free Hamiltonian cycle problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for the rectilinear crossing number of the complete graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4657586 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which crossing number is it anyway? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations Between Crossing Numbers of Complete and Complete Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rectilinear Crossing Number of a Complete Graph and Sylvester's "Four Point Problem" of Geometric Probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward a theory of crossing numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471347 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4347916 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00607-005-0133-3 / rank
 
Normal rank

Latest revision as of 03:57, 10 December 2024

scientific article
Language Label Description Also known as
English
On the crossing number of complete graphs
scientific article

    Statements

    On the crossing number of complete graphs (English)
    0 references
    0 references
    2 March 2006
    0 references
    order types
    0 references
    enumeration
    0 references
    0 references
    0 references
    0 references

    Identifiers