The pagewidth of trivalent planar graphs

DOI10.1016/0012-365X(91)90398-LzbMath0724.05022DBLPjournals/dm/Stohr91OpenAlexW2021509481WikidataQ56689184 ScholiaQ56689184MaRDI QIDQ2276971

Elena A. Stöhr

Publication date: 1991

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

Full work available at URL: https://doi.org/10.1016/0012-365x(91)90398-l

zbMATH Keywords

book imbeddingfault- tolerant VLSI designpagewidthtrivalent n-vertex planar graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• Unnamed Item
• A trade-off between page number and page width of book embeddings of graphs
• The book thickness of a graph
• Embedding Outerplanar Graphs in Small Books
• Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design

This page was built for publication: The pagewidth of trivalent planar graphs