Every triangle-free planar graph has a planar upward drawing (Q1311415)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Every triangle-free planar graph has a planar upward drawing |
scientific article; zbMATH DE number 484781
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Every triangle-free planar graph has a planar upward drawing |
scientific article; zbMATH DE number 484781 |
Statements
Every triangle-free planar graph has a planar upward drawing (English)
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
0.8445556
0 references
0 references
0.82808775
0 references
0.8240281
0 references
0.8240281
0 references
0.81765175
0 references
0.81765175
0 references