On the Complexity of the Planar Slope Number Problem (Q2971391): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Recognition and complexity of point visibility graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Planar Slope Number of Subcubic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph drawings with few slopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing Graphs in the Plane with High Resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Complexity of Upward and Rectilinear Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Intrinsic Spread of a Configuration in R d / rank
 
Normal rank
Property / cites work
 
Property / cites work: The planar slope number of planar partial 3-trees of bounded degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing Planar Graphs of Bounded Degree with Few Slopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outerplanar graph drawings with few slopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection graphs of segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar and Plane Slope Number of Partial 2-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Angular Resolution of Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5613949 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-degree graphs can have arbitrarily large slope numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realization spaces of 4-polytopes are universal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realizability of Graphs and Linkages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3974991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the decidability of Diophantine problems in combinatorial geometry / rank
 
Normal rank

Latest revision as of 15:53, 13 July 2024

scientific article
Language Label Description Also known as
English
On the Complexity of the Planar Slope Number Problem
scientific article

    Statements

    On the Complexity of the Planar Slope Number Problem (English)
    0 references
    0 references
    0 references
    5 April 2017
    0 references
    0 references
    crossing-free straight-line drawing of a graph
    0 references
    0 references