Two-page book embedding of trees under vertex-neighborhood constraints

DOI10.1016/0166-218X(93)90114-4zbMath0777.05053MaRDI QIDQ2367407

Yaron Wolfsthal, Shlomo Moran

Publication date: 10 August 1993

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

treeembeddinglinear time algorithm

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory to circuits and networks (94C15)

Related Items

Stack and queue number of 2-trees ⋮ A simple linear-time algorithm for the recognition of bandwidth-2 biconnected graphs

Cites Work

• Unnamed Item
• Unnamed Item
• The book thickness of a graph
• Linear algorithms to recognize outerplanar and maximal outerplanar graphs
• Embedding Outerplanar Graphs in Small Books
• The Complexity of Coloring Circular Arcs and Chords
• Augmentation Problems
• One-Page Book Embedding under Vertex-Neighborhood Constraints