The thickness of graphs: A survey

DOI10.1007/PL00007219MaRDI QIDQ1385299zbMATH OpenWikidataFDO

Authors Petra Mutzel, Thomas Odenthal, Mark Scharbrodt

Publication date 26 April 1998

Published in Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

surveythicknessplanar subgraph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• scientific article; zbMATH DE number 3841895
• Remarks on the thickness of a graph
• The thickness of \(K_{1,n,n}\) and \(K_{2,n,n}\)
• The thickness of a minor-excluded class of graphs

Cited in

(47)

• Simultaneous graph embedding with bends and circular arcs
• The 6-girth-thickness of the complete graph
• Geometric Thickness in a Grid of Linear Area
• A note on fold thickness of graphs
• A genetic algorithm for determining the thickness of a graph
• scientific article; zbMATH DE number 15256 (Why is no real title available?)
• Thickness‐two graphs part one: New nine‐critical graphs, permuted layer graphs, and Catlin's graphs
• Thickness and Antithickness of Graphs
• Thickness and outerthickness for embedded graphs
• Layouts of Expander Graphs
• Biplanar crossing numbers. II. Comparing crossing numbers and biplanar crossing numbers using the probabilistic method
• The 4-girth-thickness of the complete multipartite graph
• Drawing Cubic Graphs with the Four Basic Slopes
• Straight-line drawings of 1-planar graphs
• A simulated annealing algorithm for determining the thickness of a graph
• The thickness of amalgamations and Cartesian product of graphs
• Fold thickness of some classes of graphs
• Planarization and fragmentability of some classes of graphs
• Non-planar core reduction of graphs
• A simulated annealing algorithm for the maximum planar subgraph problem
• The Local Queue Number of Graphs with Bounded Treewidth
• A hypocoloring model for batch scheduling
• On simultaneous planar graph embeddings
• On graph thickness, geometric thickness, and separator theorems
• Thickness and colorability of geometric graphs
• Worst case analysis of a greedy algorithm for graph thickness
• The \(k\)-strong induced arboricity of a graph
• Treewidth, Circle Graphs, and Circular Drawings
• Heuristics for the maximum outerplanar subgraph problem
• The complexity of the empire colouring problem
• The 4-girth-thickness of the complete graph
• Note on \(k\)-planar crossing numbers
• A note on Halton's conjecture
• Cubic Graphs Have Bounded Slope Parameter
• The thickness of some complete bipartite and tripartite graphs
• scientific article; zbMATH DE number 3865305 (Why is no real title available?)
• Defective and clustered choosability of sparse graphs
• Three ways to cover a graph
• The thickness of fan-planar graphs is at most three
• Local and union boxicity
• The thickness of the complete multipartite graphs and the join of graphs
• scientific article; zbMATH DE number 4077286 (Why is no real title available?)
• The thickness of the Kronecker product of graphs
• Geometric thickness in a grid
• Planarizing graphs---a survey and annotated bibliography
• scientific article; zbMATH DE number 7071193 (Why is no real title available?)
• Thickness and connectivity in graphs

This page was built for publication: The thickness of graphs: A survey

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1385299)