Skip to main content
Log in

The Thickness of Graphs: A Survey

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00007219

Navigation