Every triangle-free planar graph has a planar upward drawing (Q1311415): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Bipartite graphs, upward drawings, and planarity / 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: Q4018725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of planar ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating orientations of ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattices contained in planar orders are planar / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3291034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar lattices and planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138867 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bemerkungen zum Vierfarbenproblem / rank
 
Normal rank

Latest revision as of 11:18, 22 May 2024

scientific article
Language Label Description Also known as
English
Every triangle-free planar graph has a planar upward drawing
scientific article

    Statements

    Every triangle-free planar graph has a planar upward drawing (English)
    0 references
    0 references
    0 references
    0 references
    22 June 1994
    0 references
    A planar upward drawing means a Hasse diagram of a partially ordered set. It is said that a planar graph \(G\) has a planar upward drawing, if it is possible to assign directions to its edges in such a way that a directed graph of a partially ordered set (shortly poset) is obtained and if this graph can be drawn in the plane as the Hasse diagram of this poset. A directed graph of a poset is the graph whose vertex set is that poset and in which an edge from \(x\) to \(y\) exists if and only if \(y\) covers \(x\) in the poset. To draw such a graph as the Hasse diagram means to draw it in such a way that \(y\) is in a higher position than \(x\) whenever \(x<y\). The main result of this paper states that every triangle-free planar graph has a planar upward drawing.
    0 references
    planar upward drawing
    0 references
    Hasse diagram
    0 references
    partially ordered set
    0 references
    triangle- free planar graph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references