AbstractThe class of 3-connected bipartite cubic graphs is shown to contain a non-Hamiltonian graph with only 78 vertices and to have a shortness exponent less than one
AbstractWe show that 3-connected cubic bipartite planar graphs with fewer than 66 vertices are Hamil...
AbstractThe fact that a cubic hamiltonian graph must have at least three spanning cycles suggests th...
AbstractThere is a constructed sequence of polyhedral cyclically 5-connected cubic non-hamiltonian g...
By constructing sequences of non-Hamiltonian graphs it is proved that (1) for k ⩾ 4, the class of k-...
AbstractThe class of 3-connected bipartite cubic graphs is shown to contain a non-Hamiltonian graph ...
AbstractWe consider the class of simple 3-polytopes the faces of which are only triangles and 7-gons...
The family of 5-valent polyhedral graphs whose faces are all triangles or 3s-gons, s ≥ 9, is shown t...
The family of 5-valent polyhedral graphs whose faces are all triangles or 3s-gons, s ≥ 9, is shown t...
AbstractWe survey results about shortness parameters for families of polyhedral graphs and mention s...
By constructing sequences of non-Hamiltonian graphs it is proved that (1) for k ⩾ 4, the class of k-...
AbstractA non-hamiltonian cyclically 4-edge-connected bicubic graph with 54 vertices is constructed....
AbstractIt is shown that, if q ⩾ 29 and q ≢ 0 (mod 3), the infinite class of 5-regular 3-polytopal g...
AbstractTutte produced the first example of a 3-connected cubic planar nonhamiltonian graph. On addi...
AbstractThis paper is concerned with non-Hamiltonian planar graphs. It is shown that the class of 3-...
AbstractA non-hamiltonian cyclically 4-edge connected bicubic graph with 50 vertices is constructed....
AbstractWe show that 3-connected cubic bipartite planar graphs with fewer than 66 vertices are Hamil...
AbstractThe fact that a cubic hamiltonian graph must have at least three spanning cycles suggests th...
AbstractThere is a constructed sequence of polyhedral cyclically 5-connected cubic non-hamiltonian g...
By constructing sequences of non-Hamiltonian graphs it is proved that (1) for k ⩾ 4, the class of k-...
AbstractThe class of 3-connected bipartite cubic graphs is shown to contain a non-Hamiltonian graph ...
AbstractWe consider the class of simple 3-polytopes the faces of which are only triangles and 7-gons...
The family of 5-valent polyhedral graphs whose faces are all triangles or 3s-gons, s ≥ 9, is shown t...
The family of 5-valent polyhedral graphs whose faces are all triangles or 3s-gons, s ≥ 9, is shown t...
AbstractWe survey results about shortness parameters for families of polyhedral graphs and mention s...
By constructing sequences of non-Hamiltonian graphs it is proved that (1) for k ⩾ 4, the class of k-...
AbstractA non-hamiltonian cyclically 4-edge-connected bicubic graph with 54 vertices is constructed....
AbstractIt is shown that, if q ⩾ 29 and q ≢ 0 (mod 3), the infinite class of 5-regular 3-polytopal g...
AbstractTutte produced the first example of a 3-connected cubic planar nonhamiltonian graph. On addi...
AbstractThis paper is concerned with non-Hamiltonian planar graphs. It is shown that the class of 3-...
AbstractA non-hamiltonian cyclically 4-edge connected bicubic graph with 50 vertices is constructed....
AbstractWe show that 3-connected cubic bipartite planar graphs with fewer than 66 vertices are Hamil...
AbstractThe fact that a cubic hamiltonian graph must have at least three spanning cycles suggests th...
AbstractThere is a constructed sequence of polyhedral cyclically 5-connected cubic non-hamiltonian g...
DOI
Add to ORKG