The pagenumber of the class of bandwidth-k graphs is \(k-1\)

DOI10.1016/0020-0190(95)00079-RzbMath0875.68691OpenAlexW2007360094MaRDI QIDQ672400

R. P. Swaminathan, D. Giriraj, Dinesh K. Bhatia

Publication date: 28 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(95)00079-r

zbMATH Keywords

Graph theoryBandwidthAnalysis of algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (6)

Embedding generalized Petersen graph in books ⋮ A survey on book-embedding of planar graphs ⋮ The pagenumber of \(k\)-trees is \(O(k)\) ⋮ Structural properties of subdivided-line graphs ⋮ Improved book-embeddings of incomplete hypercubes ⋮ Embedding connected double-loop networks with even cardinality in books

Cites Work

• Unnamed Item
• Embedding planar graphs in four pages
• The book thickness of a graph
• Embedding Outerplanar Graphs in Small Books
• Graphs with E Edges Have Pagenumber O(√E)
• One-Page Book Embedding under Vertex-Neighborhood Constraints
• Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design

This page was built for publication: The pagenumber of the class of bandwidth-k graphs is \(k-1\)