Combinatorial characterization of upward planarity (Q2316097): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Upward drawings of triconnected digraphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for plane representations of acyclic digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5786239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upward planarity testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graphical calculus for semi-groupal categories / rank
 
Normal rank
Property / cites work
 
Property / cites work: The geometry of tensor calculus. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of planar ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138867 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4154577 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to visibility representations of planar graphs / rank
 
Normal rank

Latest revision as of 01:00, 20 July 2024

scientific article
Language Label Description Also known as
English
Combinatorial characterization of upward planarity
scientific article

    Statements

    Combinatorial characterization of upward planarity (English)
    0 references
    0 references
    0 references
    26 July 2019
    0 references
    0 references
    upward planar graph
    0 references
    planar \(st\) graph
    0 references
    upward planar order
    0 references
    0 references
    0 references