Editing Hasse diagram (section)

==References==
{{refbegin|30em}}
*{{citation|first1=Kirby A.|last1=Baker|first2=Peter C.|last2=Fishburn|author2-link=Peter C. Fishburn|first3=Fred S.|last3=Roberts|author3-link=Fred S. Roberts|title=Partial orders of dimension 2|journal=Networks|volume=2|pages=11–28|issue=1|doi=10.1002/net.3230020103|year=1971}}
*{{citation|title=Digraphs: Theory, Algorithms and Applications|first1=Jørgen|last1=Bang-Jensen|series=Springer Monographs in Mathematics|edition=2nd|publisher=Springer-Verlag|year=2008|isbn=978-1-84800-997-4|contribution=2.1 Acyclic Digraphs|pages=32–34}}
*{{citation|last1=Bertolazzi|first1=R|last2=Di Battista|first2=G.|last3=Mannino|first3=C.|last4=Tamassia|first4=R.|author4-link=Roberto Tamassia|year=1993|contribution=Optimal upward planarity testing of single-source digraphs|title=[[European Symposium on Algorithms|Proc. 1st European Symposium on Algorithms (ESA '93)]]|volume=726|series=[[Lecture Notes in Computer Science]]|publisher=Springer-Verlag|pages=37–48|doi=10.1007/3-540-57273-2_42|isbn=978-3-540-57273-2|contribution-url=http://www.cs.brown.edu/research/pubs/pdfs/1998/Bertolazzi-1998-OUP.pdf|citeseerx=10.1.1.43.4879}}
*{{citation|first=Garrett|last=Birkhoff|authorlink=Garrett Birkhoff|title=Lattice Theory|edition=Revised|publisher=[[American Mathematical Society]]|year=1948}}
*{{citation|first=Hubert|last=Chan|contribution=A parameterized algorithm for upward planarity testing|title=[[European Symposium on Algorithms|Proc. 12th European Symposium on Algorithms (ESA '04)]]|year=2004|volume=3221|series=Lecture Notes in Computer Science|publisher=Springer-Verlag|pages=157–168|doi=10.1007/978-3-540-30140-0_16|isbn=978-3-540-23025-0 }}
*{{citation|title=Graph theory: an algorithmic approach|first=Nicos|last=Christofides|publisher=Academic Press|year=1975|pages=170–174}}
*{{citation|first1=G.|last1=Di Battista|first2=R.|last2=Tamassia|author2-link=Roberto Tamassia|title=Algorithms for plane representation of acyclic digraphs|journal=Theoretical Computer Science|volume=61|year=1988|pages=175–178|doi=10.1016/0304-3975(88)90123-5|issue=2–3|doi-access=}}
*{{citation|first=Ralph|last=Freese|contribution=Automated lattice drawing|title=Concept Lattices|publisher=Springer-Verlag|series=Lecture Notes in Computer Science|volume=2961|pages=589–590|year=2004|url=http://www.math.hawaii.edu/~ralph/Preprints/latdrawing.pdf}}
*{{citation|first1=Ashim|last1=Garg|first2=Roberto|last2=Tamassia|author2-link=Roberto Tamassia|title=Upward planarity testing|journal=[[Order (journal)|Order]]|volume=12|pages=109–133|year=1995a|doi=10.1007/BF01108622|issue=2|s2cid=14183717}}
*{{citation|first1=Ashim|last1=Garg|first2=Roberto|last2=Tamassia|author2-link=Roberto Tamassia|year=1995b|contribution=On the computational complexity of upward and rectilinear planarity testing|title=[[International Symposium on Graph Drawing|Graph Drawing (Proc. GD '94)]]|volume=894|series=LectureNotes in Computer Science|publisher=Springer-Verlag|pages=286–297|doi=10.1007/3-540-58950-3_384|isbn=978-3-540-58950-1|doi-access=free}}
*{{citation|first1=Michael|last1=Jünger|first2=Sebastian|last2=Leipert|contribution=Level planar embedding in linear time|title=[[International Symposium on Graph Drawing|Graph Drawing (Proc. GD '99)]]|year=1999|volume=1731|pages=72–81|doi=10.1007/3-540-46648-7_7|series=Lecture Notes in Computer Science|isbn=978-3-540-66904-3|doi-access=free}}
*{{citation
 | last = Rival | first = Ivan
 | editor-last = Rival | editor-first = Ivan
 | contribution = The diagram
 | mr = 818494
 | pages = 103–133
 | publisher = Reidel, Dordrecht
 | series = NATO Advanced Science Institutes Series C: Mathematical and Physical Sciences
 | title = Graphs and Order: The Role of Graphs in the Theory of Ordered Sets and Its Applications, Proceedings of the NATO Advanced Study Institute held in Banff, May 18–31, 1984
 | volume = 147
 | year = 1985}}
*{{citation|title=Graphs: Theory and Algorithms|first1=K.|last1=Thulasiraman|first2=M. N. S.|last2=Swamy|publisher=John Wiley and Son|year=1992|isbn=978-0-471-51356-8|contribution=5.7 Acyclic Directed Graphs|page=118}}
*{{citation|first=Henri Gustave|last=Vogt|publisher=Nony|year=1895|page=91|title=Leçons sur la résolution algébrique des équations}}
{{refend}}