Graph treewidth and geometric thickness parameters
From MaRDI portal
Publication:2369933
DOI10.1007/s00454-007-1318-7zbMath1118.05018arXivmath/0503553WikidataQ56689193 ScholiaQ56689193MaRDI QIDQ2369933
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
05C10: Planar graphs; geometric and topological aspects of graph theory
05C62: Graph representations (geometric and intersection representations, etc.)
Related Items
Relating Graph Thickness to Planar Layers and Bend Complexity, Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth, Unnamed Item, Parameterized Algorithms for Book Embedding Problems, Book Embedding of Graphs on the Projective Plane, On dispersable book embeddings, Compact navigation and distance oracles for graphs with small treewidth, On graph thickness, geometric thickness, and separator theorems, Thickness and colorability of geometric graphs, Three ways to cover a graph, A self-stabilizing algorithm for cut problems in synchronous networks, Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition, Induced and weak induced arboricities, 1-page and 2-page drawings with bounded number of crossings per edge, On the planar split thickness of graphs, Coloring drawings of graphs, A survey on book-embedding of planar graphs, Embedding planar 5-graphs in three pages, Planar graphs that need four pages, Parameterized algorithms for book embedding problems, Local and union page numbers, On exteriority notions in book embeddings and treewidth, The book thickness of 1-planar graphs is constant, Book embedding of locally planar graphs on orientable surfaces, Compact Navigation and Distance Oracles for Graphs with Small Treewidth, Drawing Cubic Graphs with the Four Basic Slopes, PROXIMITY DRAWINGS OF HIGH-DEGREE TREES, Layouts of Expander Graphs
