One-Page Book Embedding under Vertex-Neighborhood Constraints

DOI10.1137/0403034zbMath0742.05060OpenAlexW2085682976MaRDI QIDQ4713054

Yaron Wolfstahl, Shlomo Moran

Publication date: 25 June 1992

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/6eff88944c282eec79d644e91d5b7a39d0656cfc

zbMATH Keywords

algorithmbook embeddingouterplanar graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Applications of graph theory to circuits and networks (94C15) Eulerian and Hamiltonian graphs (05C45)

Related Items (8)

Planar rectilinear drawings of outerplanar graphs in linear time ⋮ Two-page book embedding of trees under vertex-neighborhood constraints ⋮ A survey on book-embedding of planar graphs ⋮ Planar straight-line realizations of 2-trees with prescribed edge lengths ⋮ The pagenumber of the class of bandwidth-k graphs is \(k-1\) ⋮ A simple linear-time algorithm for the recognition of bandwidth-2 biconnected graphs ⋮ Schematic Representation of Large Biconnected Graphs ⋮ Schematic Representation of Biconnected Graphs

This page was built for publication: One-Page Book Embedding under Vertex-Neighborhood Constraints