The thickness of a minor-excluded class of graphs

DOI10.1016/S0012-365X(97)00146-5zbMath0888.05046OpenAlexW1974098410WikidataQ56977453 ScholiaQ56977453MaRDI QIDQ1379835

Petra Mutzel, Mark Scharbrodt, Thomas Odenthal, Michael Jünger

Publication date: 13 May 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00146-5

zbMATH Keywords

decompositionthicknessgraph minorcrossing numberskewnessplanar 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) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Thickness and outerthickness for embedded graphs ⋮ Remarks on the thickness of a graph ⋮ A genetic algorithm for determining the thickness of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• On the thickness and arboricity of a graph
• On the thickness of graphs of given degree
• Über eine Eigenschaft der ebenen Komplexe
• Determining the thickness of graphs is NP-hard
• Efficient Planarity Testing

This page was built for publication: The thickness of a minor-excluded class of graphs