Publication date
November 1997
DOI Publisher
Published by Elsevier B.V. ISSN
0166-218XAbstract
AbstractThere is a constructed sequence of polyhedral cyclically 5-connected cubic non-hamiltonian graphs having only 5-gons and 8-gons as faces
AbstractThere is a constructed sequence of polyhedral cyclically 5-connected cubic non-hamiltonian graphs having only 5-gons and 8-gons as faces
AbstractSettling a question of Tutte and a similar question of Grünbaum and Zaks, we present a 3-val...
AbstractWe prove that every edge in a 5-connected graph embedded in the torus is contained in a Hami...
AbstractIt is shown that, if q ⩾ 29 and q ≢ 0 (mod 3), the infinite class of 5-regular 3-polytopal g...
AbstractWe consider classes of cubic polyhedral graphs whose non-q-gonal faces are adjacent to q-gon...
AbstractThere is a constructed sequence of polyhedral cyclically 5-connected cubic non-hamiltonian g...
AbstractIn the class of all 5-regular multitriangular polyhedral graphs there exists a nonhamiltonia...
AbstractIt is shown that for every value of an integer k, k⩾11, there exist 3-valent 3-connected pla...
AbstractWe consider the class of simple 3-polytopes the faces of which are only triangles and 7-gons...
AbstractWe show that all 3-connected cubic planar graphs on 36 or fewer vertices are hamiltonian, th...
AbstractIn this paper is proved that any simple 3-polytope, all of whose edges are incident with eit...
AbstractThe smallest number of vertices, edges, or faces of any 3-polytope with no Hamiltonian circu...
In 1956, Tutte showed that every planar 4-connected graph is hamiltonian. In this article, we will g...
In 1956, Tutte showed that every planar 4-connected graph is hamiltonian. In this article, we will g...
AbstractA non-hamiltonian cyclically 4-edge connected bicubic graph with 50 vertices is constructed....
AbstractThe smallest number of vertices, edges, or faces of any 3-polytope with no Hamiltonian path ...
AbstractSettling a question of Tutte and a similar question of Grünbaum and Zaks, we present a 3-val...
AbstractWe prove that every edge in a 5-connected graph embedded in the torus is contained in a Hami...
AbstractIt is shown that, if q ⩾ 29 and q ≢ 0 (mod 3), the infinite class of 5-regular 3-polytopal g...
AbstractWe consider classes of cubic polyhedral graphs whose non-q-gonal faces are adjacent to q-gon...
AbstractThere is a constructed sequence of polyhedral cyclically 5-connected cubic non-hamiltonian g...
AbstractIn the class of all 5-regular multitriangular polyhedral graphs there exists a nonhamiltonia...
AbstractIt is shown that for every value of an integer k, k⩾11, there exist 3-valent 3-connected pla...
AbstractWe consider the class of simple 3-polytopes the faces of which are only triangles and 7-gons...
AbstractWe show that all 3-connected cubic planar graphs on 36 or fewer vertices are hamiltonian, th...
AbstractIn this paper is proved that any simple 3-polytope, all of whose edges are incident with eit...
AbstractThe smallest number of vertices, edges, or faces of any 3-polytope with no Hamiltonian circu...
In 1956, Tutte showed that every planar 4-connected graph is hamiltonian. In this article, we will g...
In 1956, Tutte showed that every planar 4-connected graph is hamiltonian. In this article, we will g...
AbstractA non-hamiltonian cyclically 4-edge connected bicubic graph with 50 vertices is constructed....
AbstractThe smallest number of vertices, edges, or faces of any 3-polytope with no Hamiltonian path ...
AbstractSettling a question of Tutte and a similar question of Grünbaum and Zaks, we present a 3-val...
AbstractWe prove that every edge in a 5-connected graph embedded in the torus is contained in a Hami...
AbstractIt is shown that, if q ⩾ 29 and q ≢ 0 (mod 3), the infinite class of 5-regular 3-polytopal g...
Add to ORKG