The thickness of graphs: A survey
From MaRDI portal
Publication:1385299
DOI10.1007/PL00007219zbMath0896.05020WikidataQ56689311 ScholiaQ56689311MaRDI QIDQ1385299
Thomas Odenthal, Mark Scharbrodt, Petra Mutzel
Publication date: 26 April 1998
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
The thickness of amalgamations and Cartesian product of graphs, On simultaneous planar graph embeddings, A simulated annealing algorithm for the maximum planar subgraph problem, The 4-girth-thickness of the complete graph, The \(k\)-strong induced arboricity of a graph, The thickness of the complete multipartite graphs and the join of graphs, Drawing Cubic Graphs with the Four Basic Slopes, Straight-line drawings of 1-planar graphs, On graph thickness, geometric thickness, and separator theorems, Three ways to cover a graph, Planarization and fragmentability of some classes of graphs, The thickness of fan-planar graphs is at most three, Note on \(k\)-planar crossing numbers, Treewidth, Circle Graphs, and Circular Drawings, Local and union boxicity, Geometric thickness in a grid, The complexity of the empire colouring problem, Planar projections of graphs, Thickness and outerthickness for embedded graphs, Thickness and colorability of geometric graphs, Simultaneous graph embedding with bends and circular arcs, A hypocoloring model for batch scheduling, A note on Halton's conjecture, Layouts of Expander Graphs, Biplanar crossing numbers. II. Comparing crossing numbers and biplanar crossing numbers using the probabilistic method, Cubic Graphs Have Bounded Slope Parameter, The 6-girth-thickness of the complete graph, Worst case analysis of a greedy algorithm for graph thickness, Non-planar core reduction of graphs, Defective and clustered choosability of sparse graphs, The thickness of the Kronecker product of graphs, A simulated annealing algorithm for determining the thickness of a graph, Heuristics for the maximum outerplanar subgraph problem, The 4-girth-thickness of the complete multipartite graph, The Local Queue Number of Graphs with Bounded Treewidth, Geometric Thickness in a Grid of Linear Area, A genetic algorithm for determining the thickness of a graph
