Untangling polygons and graphs (Q848672): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Trees in Polyhedral Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial bound for untangling geometric planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5786239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Untangling a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Untangling planar graphs from a specified vertex position-Hard cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Untangling a polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Collinear Sets in Straight-Line Drawings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the obfuscation complexity of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bemerkungen zum Vierfarbenproblem / rank
 
Normal rank

Latest revision as of 12:06, 2 July 2024

scientific article
Language Label Description Also known as
English
Untangling polygons and graphs
scientific article

    Statements

    Untangling polygons and graphs (English)
    0 references
    0 references
    4 March 2010
    0 references
    graph drawing
    0 references
    planarity
    0 references
    straight-line drawing
    0 references
    untangling
    0 references
    polygons
    0 references

    Identifiers