Construction of Barnette graphs whose large subgraphs are non-Hamiltonian

Barnette's Conjecture Through the Lens of the Complexity Classes

RD Barish, A Suyama - … and Computational Geometry, Graphs, and Games …, 2021 - Springer
Abstract In circa 2006, Feder & Subi established that Barnette's 1969 conjecture, which
postulates that all cubic bipartite polyhedral graphs are Hamiltonian, is true if and only if the …
相关文章 所有 2 个版本