Remarks on the thickness of a graph

DOI10.1016/S0020-0255(97)10059-7zbMATH Open0923.05033MaRDI QIDQ1292575FDOQ1292575

T. Systä, Isto Aho, Erkki Mäkinen

Publication date: 22 June 1999

Published in: Information Sciences (Search for Journal in Brave)

zbMATH Keywords

decompositionthicknessplanarityplanar subgraphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• Parallel concepts in graph theory
• The Thickness of the Complete Graph
• Title not available (Why is that?)
• On the thickness and arboricity of a graph
• On the thickness of graphs of given degree
• Title not available (Why is that?)
• Title not available (Why is that?)
• The thickness of a minor-excluded class of graphs

Cited In (9)

• A note on fold thickness of graphs
• A genetic algorithm for determining the thickness of a graph
• Thickness and Antithickness of Graphs
• Thickness and outerthickness for embedded graphs
• Fold thickness of some classes of graphs
• Remarks on the thickness of K_n,n,n
• A note on Halton's conjecture
• Thickness and connectivity in graphs
• Precedence thinness in graphs

   Recommendations

• Remarks on the thickness of K_n,n,n 👍 👎
• Remarks on the thickness and outerthickness of a graph 👍 👎
• A note on the thickness of some complete bipartite graphs 👍 👎
• The thickness of K1,n,n and K2,n,n 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Remarks on the thickness of a graph

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