Fundamentals of planar ordered sets (Q1086596): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Extending maps of plane Peano continua / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graph-theoretic parameters concerning domination, independence, and irredundance / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5600713 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5786239 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the dimension of partially ordered sets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Planar Lattices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3964626 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4119824 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Planar lattices and planar graphs / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0012-365x(87)90008-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2058177791 / rank | |||
Normal rank | |||
Latest revision as of 10:59, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fundamentals of planar ordered sets |
scientific article |
Statements
Fundamentals of planar ordered sets (English)
0 references
1987
0 references
If it is possible to draw in a plane a (Hasse) diagram for a finite partially ordered set using non-intersecting arcs, then it is possible to draw it using only non-intersecting stright-line segments. Proofs are of topological and combinatorial nature, and are obtained working with directed graphs.
0 references
planar graphs
0 references
Hasse diagram
0 references
finite partially ordered set
0 references
