On the Number of Crossing‐Free Matchings, Cycles, and Partitions (Q3446814): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q54308783, #quickstatements; #temporary_batch_1707216511891
Set OpenAlex properties.
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Micha Sharir / rank
Normal rank
 
Property / author
 
Property / author: Ermo Welzl / rank
Normal rank
 
Property / author
 
Property / author: Micha Sharir / rank
 
Normal rank
Property / author
 
Property / author: Ermo Welzl / 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.1137/050636036 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2085179971 / rank
 
Normal rank

Latest revision as of 02:40, 20 March 2024

scientific article
Language Label Description Also known as
English
On the Number of Crossing‐Free Matchings, Cycles, and Partitions
scientific article

    Statements

    On the Number of Crossing‐Free Matchings, Cycles, and Partitions (English)
    0 references
    0 references
    26 June 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    crossing-free geometric graphs
    0 references
    counting
    0 references
    simple polygonizations
    0 references
    crossing-free matchings
    0 references
    crossing-free partitions
    0 references
    0 references
    0 references
    0 references
    0 references