Recommendations
Cites work
- scientific article; zbMATH DE number 3957136 (Why is no real title available?)
- scientific article; zbMATH DE number 3657692 (Why is no real title available?)
- Biplanar graphs: A survey
- Determining the thickness of graphs is NP-hard
- Multilayer grid embeddings for VLSI
- On the thickness of graphs of given degree
- Regular Graphs with Given Girth and Restricted Circuits
- The thickness of graphs: A survey
Cited in
(15)- A simulated annealing algorithm for determining the thickness of a graph
- scientific article; zbMATH DE number 3505096 (Why is no real title available?)
- scientific article; zbMATH DE number 3957136 (Why is no real title available?)
- A note on the Hambleton-Taylor-Williams conjecture
- Remarks on the thickness and outerthickness of a graph
- scientific article; zbMATH DE number 6263412 (Why is no real title available?)
- Biplanar crossing numbers. II. Comparing crossing numbers and biplanar crossing numbers using the probabilistic method
- A note on the Bateman-Horn conjecture
- scientific article; zbMATH DE number 224040 (Why is no real title available?)
- scientific article; zbMATH DE number 1302890 (Why is no real title available?)
- On Hall's conjecture
- On the biplanarity of blowups
- A note on two conjectures
- scientific article; zbMATH DE number 1953110 (Why is no real title available?)
- On Hilali's conjecture related to Halperin's
This page was built for publication: A note on Halton's conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q707336)