Fundamentals of planar ordered sets (Q1086596)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3985285
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fundamentals of planar ordered sets |
scientific article; zbMATH DE number 3985285 |
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
0.92229366
0 references
0.8862585
0 references
0.88299763
0 references
0.8796178
0 references
0.87488496
0 references
0.8748669
0 references
0.87451124
0 references
