Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices (Q848671): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59410429, #quickstatements; #temporary_batch_1714685954669
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The book thickness of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On simultaneous planar graph embeddings / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to draw a planar graph on a grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Curve-constrained drawings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding Graphs into a Three Page Book with O(m log n) Crossings of Edges over the Spine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding Vertices at Points: Few Bends Suffice for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding planar graphs at fixed vertex locations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138887 / rank
 
Normal rank

Latest revision as of 13:06, 2 July 2024

scientific article
Language Label Description Also known as
English
Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices
scientific article

    Statements

    Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 March 2010
    0 references
    0 references
    graph drawing
    0 references
    universal point sets
    0 references
    one-bend drawings
    0 references
    simultaneous embeddings
    0 references
    0 references
    0 references