Graph treewidth and geometric thickness parameters

DOI10.1007/s00454-007-1318-7zbMath1118.05018arXivmath/0503553OpenAlexW2070606919WikidataQ56689193 ScholiaQ56689193MaRDI QIDQ2369933

David R. Wood, Vida Dujmović

Publication date: 21 June 2007

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0503553

zbMATH Keywords

drawingbook thicknessarboricityouterthicknesscrossing

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (36)

Induced and weak induced arboricities ⋮ Book embedding of locally planar graphs on orientable surfaces ⋮ A survey on book-embedding of planar graphs ⋮ PROXIMITY DRAWINGS OF HIGH-DEGREE TREES ⋮ Stack-number is not bounded by queue-number ⋮ Relating Graph Thickness to Planar Layers and Bend Complexity ⋮ Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth ⋮ Parameterized analysis and crossing minimization problems ⋮ The book thickness of 1-planar graphs is constant ⋮ 1-page and 2-page drawings with bounded number of crossings per edge ⋮ Embedding planar 5-graphs in three pages ⋮ Drawing Cubic Graphs with the Four Basic Slopes ⋮ Book embeddings of \(k\)-framed graphs and \(k\)-map graphs ⋮ On graph thickness, geometric thickness, and separator theorems ⋮ Graphs of linear growth have bounded treewidth ⋮ Three ways to cover a graph ⋮ Unnamed Item ⋮ Treewidth, Circle Graphs, and Circular Drawings ⋮ Planar graphs that need four pages ⋮ Parameterized algorithms for book embedding problems ⋮ Local and union page numbers ⋮ Compact navigation and distance oracles for graphs with small treewidth ⋮ Parameterized Algorithms for Book Embedding Problems ⋮ On the planar split thickness of graphs ⋮ Compact Navigation and Distance Oracles for Graphs with Small Treewidth ⋮ Thickness and colorability of geometric graphs ⋮ A self-stabilizing algorithm for cut problems in synchronous networks ⋮ On dispersable book embeddings ⋮ Layouts of Expander Graphs ⋮ Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition ⋮ On the upward book thickness problem: combinatorial and complexity results ⋮ On exteriority notions in book embeddings and treewidth ⋮ On the upward book thickness problem: combinatorial and complexity results ⋮ Coloring drawings of graphs ⋮ Book Embedding of Graphs on the Projective Plane ⋮ Geodesic obstacle representation of graphs

This page was built for publication: Graph treewidth and geometric thickness parameters