Remarks on the thickness and outerthickness of a graph
type: Item
instance of: scholarly article
title: Remarks on the thickness and outerthickness of a graph
zbMATH Open document ID: 1080.05076
publication date: 2006-02-02T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 5003133
zbMATH Keywords: combinatorial problems
zbMATH Keywords: annealing algorithm
author: Timo Poranen
author: Erkki Mäkinen
MaRDI profile type: Publication
full work available at URL: j.camwa.2004.10.048
OpenAlex ID: W2041376359
cites work: Q3866146
cites work: Determining the thickness of graphs is NP-hard
cites work: Q5732335
cites work: Biplanar graphs: A survey
cites work: A simulated annealing algorithm for determining the thickness of a graph
cites work: Q3972003
cites work: Q3726142
cites work: On the thickness of graphs of given degree
cites work: A note on Halton's conjecture
cites work: On the thickness and arboricity of a graph
cites work: Parallel concepts in graph theory
DOI: 10.1016/J.CAMWA.2004.10.048
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 5003133