Planar tree transformation: results and counterexample (Q975528): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q124977496, #quickstatements; #temporary_batch_1712261475387
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On planar path transformation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating rooted triangulations without repetitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reverse search for enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flips in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the number of crossing-free subgraphs of \(K_N\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On local transformation of polygons with visibility properties. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric tree graphs of points in convex position / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transforming triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On connectivities of tree graphs / rank
 
Normal rank

Latest revision as of 22:26, 2 July 2024

scientific article
Language Label Description Also known as
English
Planar tree transformation: results and counterexample
scientific article

    Statements

    Planar tree transformation: results and counterexample (English)
    0 references
    0 references
    0 references
    0 references
    9 June 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    computational geometry
    0 references
    planar tree
    0 references
    flip
    0 references
    transformation
    0 references
    canonical tree
    0 references
    0 references
    0 references