The 2-page crossing number of \(K_{n}\) (Q2391708): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Oswin Aichholzer / rank
Normal rank
 
Property / author
 
Property / author: Oswin Aichholzer / 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/s00454-013-9514-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W43174409 / 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: 3-symmetric and 3-decomposable geometric drawings of \(K_n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 2-page crossing number of K <sub>n</sub> / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(\leq k\)-edges, crossings, and halving lines of geometric drawings of \(K _{n }\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rectilinear Crossing Number of K n : Closing in (or Are We?) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The early history of the brick factory problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5543311 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Point sets that minimize \((\leq k)\)-edges, 3-decomposable drawings, and the rectilinear crossing number of \(K_{30}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the fixed linear crossing number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5688095 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Lower Bounds for the 2-Page Crossing Numbers of $K_{m,n}$ and $K_n$ via Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4667610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The toroidal crossing number of the complete graph / 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: Special numbers of crossings for complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Axioms and hulls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4657586 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The book crossing number of a graph / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:56, 6 July 2024

scientific article
Language Label Description Also known as
English
The 2-page crossing number of \(K_{n}\)
scientific article

    Statements

    The 2-page crossing number of \(K_{n}\) (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 August 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    crossing number
    0 references
    topological drawing
    0 references
    complete graph
    0 references
    book drawing
    0 references
    2-page drawing
    0 references
    0 references