Ordered sets, pagenumbers and planarity

DOI10.1007/BF00563521zbMath0701.06005OpenAlexW2068287758MaRDI QIDQ913833

Andrew Parker, Richard J. Nowakowski

Publication date: 1989

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00563521

zbMATH Keywords

schedulingplanaritybook embeddingplanar graphHasse diagrampage numberlinear extensionplanar posetcovering graphrelation graphlinear layoutbook number

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Deterministic scheduling theory in operations research (90B35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (15)

A survey on book-embedding of planar graphs ⋮ Embedding planar 5-graphs in three pages ⋮ A Sublinear Bound on the Page Number of Upward Planar Graphs ⋮ Upward book embeddability of \(st\)-graphs: complexity and algorithms ⋮ Recognizing DAGs with page-number 2 is NP-complete ⋮ Ordered sets, pagenumbers and planarity ⋮ Computing Upward Topological Book Embeddings of Upward Planar Digraphs ⋮ Computing upward topological book embeddings of upward planar digraphs ⋮ Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings ⋮ Recognizing DAGs with page-number 2 is NP-complete ⋮ On the upward book thickness problem: combinatorial and complexity results ⋮ On the upward book thickness problem: combinatorial and complexity results ⋮ Upward Book Embeddings of st-Graphs ⋮ On Posets of Page Number 2 ⋮ On Page Number of N-free Posets

Cites Work

• Ordered sets, pagenumbers and planarity
• The book thickness of a graph
• Planar Lattices
• Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Ordered sets, pagenumbers and planarity