A note on Halton's conjecture
From MaRDI portal
Publication:707336
DOI10.1016/J.INS.2003.06.008zbMATH Open1094.05021OpenAlexW1968235777WikidataQ122894089 ScholiaQ122894089MaRDI QIDQ707336FDOQ707336
Authors: 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
Recommendations
Cites Work
- Regular Graphs with Given Girth and Restricted Circuits
- Title not available (Why is that?)
- The thickness of graphs: A survey
- Biplanar graphs: A survey
- On the thickness of graphs of given degree
- Multilayer grid embeddings for VLSI
- Determining the thickness of graphs is NP-hard
- Title not available (Why is that?)
Cited In (15)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A note on two conjectures
- A note on the Hambleton-Taylor-Williams conjecture
- Title not available (Why is that?)
- Biplanar crossing numbers. II. Comparing crossing numbers and biplanar crossing numbers using the probabilistic method
- On Hall's conjecture
- A simulated annealing algorithm for determining the thickness of a graph
- Title not available (Why is that?)
- A note on the Bateman-Horn conjecture
- On Hilali's conjecture related to Halperin's
- On the biplanarity of blowups
- Title not available (Why is that?)
- Remarks on the thickness and outerthickness of a graph
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)