Approximating Barnette's conjecture

DOI10.4230/LIPICS.GD.2025.6MaRDI QIDQ7354796zbMATH OpenFDO

Authors Michael A. Bekos, Michael Kaufmann, Maximilian Pfister

Publication date 21 September 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.GD.2025.6

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites work

• Hamiltonian circuits in polytopes with even sided faces
• Hamiltonian cycles in cubic 3-connected bipartite planar graphs
• scientific article; zbMATH DE number 3305794 (Why is no real title available?)
• Listing`s topology.
• On dispersable book embeddings
• On Hamiltonian Circuits
• Remarks on Barnette's conjecture
• The minimality of the Georges-Kelmans graph
• Thoughts on Barnette's conjecture

This page was built for publication: Approximating Barnette's conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7354796)