A note on Halton's conjecture

DOI10.1016/j.ins.2003.06.008zbMath1094.05021OpenAlexW1968235777WikidataQ122894089 ScholiaQ122894089MaRDI QIDQ707336

Ondrej Sýkora, László A. Székely, Imrich Vrt'o

Publication date: 9 February 2005

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

Full work available at URL: https://doi.org/10.1016/j.ins.2003.06.008

zbMATH Keywords

Planar graphDegreeThickness

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (3)

Biplanar crossing numbers. II. Comparing crossing numbers and biplanar crossing numbers using the probabilistic method ⋮ A simulated annealing algorithm for determining the thickness of a graph ⋮ Remarks on the thickness and outerthickness of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Multilayer grid embeddings for VLSI
• On the thickness of graphs of given degree
• The thickness of graphs: A survey
• Biplanar graphs: A survey
• Determining the thickness of graphs is NP-hard
• Regular Graphs with Given Girth and Restricted Circuits

This page was built for publication: A note on Halton's conjecture