Remarks on the thickness and outerthickness of a graph

DOI10.1016/j.camwa.2004.10.048zbMath1080.05076OpenAlexW2041376359MaRDI QIDQ814092

Timo Poranen, Erkki Maekinen

Publication date: 2 February 2006

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2004.10.048

zbMATH Keywords

combinatorial problemsannealing algorithm

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

The complexity of the empire colouring problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on Halton's conjecture
• On the thickness and arboricity of a graph
• On the thickness of graphs of given degree
• Parallel concepts in graph theory
• Biplanar graphs: A survey
• A simulated annealing algorithm for determining the thickness of a graph
• Determining the thickness of graphs is NP-hard

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