A new proof of Vázsonyi's conjecture (Q942175): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Some properties of graphs of diameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sets of Distances of n Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3239719 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3237947 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On geometric graphs with no two edges in convex position / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4339095 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized thrackles and geometric graphs in \({\mathbb{R}}^3\) with no pair of strongly avoiding edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3241604 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On geometric graphs with no \(k\) pairwise parallel edges / rank
 
Normal rank

Latest revision as of 16:13, 28 June 2024

scientific article
Language Label Description Also known as
English
A new proof of Vázsonyi's conjecture
scientific article

    Statements

    A new proof of Vázsonyi's conjecture (English)
    0 references
    4 September 2008
    0 references
    0 references
    Vázsonyi's conjecture
    0 references
    diameter graph
    0 references
    graph drawing
    0 references
    topological graph theory
    0 references
    0 references
    0 references
    0 references