Abstract.
We give a state-of-the-art survey of the thickness of a graph from both a theoretical and a practical point of view. After summarizing the relevant results concerning this topological invariant of a graph, we deal with practical computation of the thickness. We present some modifications of a basic heuristic and investigate their usefulness for evaluating the thickness and determining a decomposition of a graph in planar subgraphs.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Mutzel, P., Odenthal, T. & Scharbrodt, M. The Thickness of Graphs: A Survey. Graphs Comb 14, 59–73 (1998). https://doi.org/10.1007/PL00007219
Issue Date:
DOI: https://doi.org/10.1007/PL00007219