Graph treewidth and geometric thickness parameters

From MaRDI portal
Revision as of 18:05, 2 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2369933

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




Related Items (36)

Induced and weak induced arboricitiesBook embedding of locally planar graphs on orientable surfacesA survey on book-embedding of planar graphsPROXIMITY DRAWINGS OF HIGH-DEGREE TREESStack-number is not bounded by queue-numberRelating Graph Thickness to Planar Layers and Bend ComplexityCrossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded TreewidthParameterized analysis and crossing minimization problemsThe book thickness of 1-planar graphs is constant1-page and 2-page drawings with bounded number of crossings per edgeEmbedding planar 5-graphs in three pagesDrawing Cubic Graphs with the Four Basic SlopesBook embeddings of \(k\)-framed graphs and \(k\)-map graphsOn graph thickness, geometric thickness, and separator theoremsGraphs of linear growth have bounded treewidthThree ways to cover a graphUnnamed ItemTreewidth, Circle Graphs, and Circular DrawingsPlanar graphs that need four pagesParameterized algorithms for book embedding problemsLocal and union page numbersCompact navigation and distance oracles for graphs with small treewidthParameterized Algorithms for Book Embedding ProblemsOn the planar split thickness of graphsCompact Navigation and Distance Oracles for Graphs with Small TreewidthThickness and colorability of geometric graphsA self-stabilizing algorithm for cut problems in synchronous networksOn dispersable book embeddingsLayouts of Expander GraphsSublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decompositionOn the upward book thickness problem: combinatorial and complexity resultsOn exteriority notions in book embeddings and treewidthOn the upward book thickness problem: combinatorial and complexity resultsColoring drawings of graphsBook Embedding of Graphs on the Projective PlaneGeodesic obstacle representation of graphs







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