On graph thickness, geometric thickness, and separator theorems
type: Item
instance of: scholarly article
title: On graph thickness, geometric thickness, and separator theorems
zbMATH Open document ID: 1205.05161
author: Christian A. Duncan
published in: Computational Geometry
publication date: 2011-01-31T00:00:00Z
Mathematics Subject Classification ID: 05C62
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 5842968
zbMATH Keywords: graph thickness
zbMATH Keywords: geometric thickness
zbMATH Keywords: outerthickness
zbMATH Keywords: arboricity
zbMATH Keywords: planar separators
MaRDI profile type: Publication
full work available at URL: j.comgeo.2010.09.005
OpenAlex ID: W2150730153
cites work: Thickness and coarseness of graphs
cites work: On the thickness of graphs of given degree
cites work: Embedding planar graphs at fixed vertex locations
cites work: Every planar graph with nine points has a nonplanar complement
cites work: The Non-Biplanar Character of the Complete 9-Graph
cites work: Q5735733
cites work: The thickness of graphs: A survey
cites work: Geometric Thickness of Complete Graphs
cites work: The book thickness of a graph
cites work: Q4657580
cites work: Edge-Disjoint Spanning Trees of Finite Graphs
cites work: Decomposition of Finite Graphs Into Forests
cites work: On the Problem of Decomposing a Graph into n Connected Factors
cites work: Covering and packing in graphs IV: Linear arboricity
cites work: The linear arboricity of graphs
cites work: Q3972003
cites work: Multilayer grid embeddings for VLSI
cites work: On simultaneous planar graph embeddings
cites work: The geometric thickness of low degree graphs
cites work: Two trees which are self-intersecting when drawn simultaneously
cites work: Graphs with E Edges Have Pagenumber O(√E)
cites work: Bounded-degree graphs have arbitrarily large geometric thickness
cites work: Graph treewidth and geometric thickness parameters
cites work: On the Hadwiger's conjecture for graph products
cites work: A Separator Theorem for Planar Graphs
cites work: Planar Separators
cites work: A partial k-arboretum of graphs with bounded treewidth
cites work: Excluding any graph as a minor allows a low tree-width 2-coloring
cites work: A Separator Theorem for Nonplanar Graphs
cites work: Efficient Algorithms for Optimization and Selection on Series-Parallel Graphs
DOI: 10.1016/J.COMGEO.2010.09.005
Recommended article: Geometric Thickness of Complete Graphs
Recommended article: On the thickness of graphs of given degree
Recommended article: The thickness of graphs: A survey
Recommended article: The geometric thickness of low degree graphs
Recommended article: On the planar split thickness of graphs
Recommended article: On the genus and thickness of graphs
Recommended article: On the thickness and arboricity of a graph
Recommended article: Thickness and colorability of geometric graphs
Recommended article: Thickness and Colorability of Geometric Graphs
description: scientific article; zbMATH DE number 5842968