The pagewidth of trivalent planar graphs

DOI10.1016/0012-365X(91)90398-LMaRDI QIDQ2276971zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Elena 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)

Recommendations

• Embedding Outerplanar Graphs in Small Books
• scientific article; zbMATH DE number 3914339
• Embedding planar graphs in four pages
• A survey on book-embedding of planar graphs
• The pagenumber of genus g graphs is O( g )

Cites work

• scientific article; zbMATH DE number 3959290 (Why is no real title available?)
• A trade-off between page number and page width of book embeddings of graphs
• Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
• Embedding Outerplanar Graphs in Small Books
• The book thickness of a graph

Cited in

(1)

• On the pagenumber of trivalent Cayley graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2276971)