Fundamentals of planar ordered sets (Q1086596): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
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 |
Revision as of 17:11, 17 June 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