Stack and queue number of 2-trees

DOI10.1007/bfb0030834zbMath1527.68168OpenAlexW1957150339WikidataQ61067926 ScholiaQ61067926MaRDI QIDQ6085708

C. E. Veni Madhavan, S. Rengarajan

Publication date: 12 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0030834

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (10)

Planar straight-line realizations of 2-trees with prescribed edge lengths ⋮ The Rique-number of graphs ⋮ Local and union page numbers ⋮ Lazy queue layouts of posets ⋮ Mixed Linear Layouts of Planar Graphs ⋮ Queue layouts of planar 3-trees ⋮ Recognizing DAGs with page-number 2 is NP-complete ⋮ The Local Queue Number of Graphs with Bounded Treewidth ⋮ Lazy Queue Layouts of Posets ⋮ On Mixed Linear Layouts of Series-Parallel Graphs

Cites Work

• The book thickness of a graph
• Two-page book embedding of trees under vertex-neighborhood constraints
• Laying Out Graphs Using Queues
• Graphs with E Edges Have Pagenumber O(√E)
• Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design

This page was built for publication: Stack and queue number of 2-trees