AbstractWe consider two classes of simple 3-polytopal graphs whose edges are incident with either two 5-gons or a 5-gon and q-gon (q = 26 or 27). We show that the shortness coefficient is less than 1 for both of these classes
ABSTRACT. The paper deals with the longest circuits in triangular and quadran-gular 3-polytopes with...
AbstractBy a theorem of W.T. Tutte the toughness t(G) of a nonhamiltonian polyhedral graph G is less...
AbstractIn this paper is proved that any simple 3-polytope, all of whose edges are incident with eit...
AbstractWe consider classes of simple 3-polytopal graphs whose edges are incident with either two 5-...
AbstractIt is shown that, if q ⩾ 29 and q ≢ 0 (mod 3), the infinite class of 5-regular 3-polytopal g...
AbstractIt is shown that, if q ⩾ 29 and q ≢ 0 (mod 3), the infinite class of 5-regular 3-polytopal g...
AbstractWe consider the class of simple 3-polytopes the faces of which are only triangles and 7-gons...
AbstractThis paper is concerned with non-Hamiltonian planar graphs. It is shown that the class of 3-...
By constructing sequences of non-Hamiltonian graphs it is proved that (1) for k ⩾ 4, the class of k-...
AbstractFor some families of graphs of simplicial 3-polytopes with two types of edges structural pro...
AbstractIn the class of all 5-regular multitriangular polyhedral graphs there exists a nonhamiltonia...
AbstractThe class of 3-connected bipartite cubic graphs is shown to contain a non-Hamiltonian graph ...
AbstractWe survey results about shortness parameters for families of polyhedral graphs and mention s...
AbstractIn the class of all 5-regular multitriangular polyhedral graphs there exists a nonhamiltonia...
AbstractKnown estimates of the maximal length of simple circuits in certain 3-connected planar graph...
ABSTRACT. The paper deals with the longest circuits in triangular and quadran-gular 3-polytopes with...
AbstractBy a theorem of W.T. Tutte the toughness t(G) of a nonhamiltonian polyhedral graph G is less...
AbstractIn this paper is proved that any simple 3-polytope, all of whose edges are incident with eit...
AbstractWe consider classes of simple 3-polytopal graphs whose edges are incident with either two 5-...
AbstractIt is shown that, if q ⩾ 29 and q ≢ 0 (mod 3), the infinite class of 5-regular 3-polytopal g...
AbstractIt is shown that, if q ⩾ 29 and q ≢ 0 (mod 3), the infinite class of 5-regular 3-polytopal g...
AbstractWe consider the class of simple 3-polytopes the faces of which are only triangles and 7-gons...
AbstractThis paper is concerned with non-Hamiltonian planar graphs. It is shown that the class of 3-...
By constructing sequences of non-Hamiltonian graphs it is proved that (1) for k ⩾ 4, the class of k-...
AbstractFor some families of graphs of simplicial 3-polytopes with two types of edges structural pro...
AbstractIn the class of all 5-regular multitriangular polyhedral graphs there exists a nonhamiltonia...
AbstractThe class of 3-connected bipartite cubic graphs is shown to contain a non-Hamiltonian graph ...
AbstractWe survey results about shortness parameters for families of polyhedral graphs and mention s...
AbstractIn the class of all 5-regular multitriangular polyhedral graphs there exists a nonhamiltonia...
AbstractKnown estimates of the maximal length of simple circuits in certain 3-connected planar graph...
ABSTRACT. The paper deals with the longest circuits in triangular and quadran-gular 3-polytopes with...
AbstractBy a theorem of W.T. Tutte the toughness t(G) of a nonhamiltonian polyhedral graph G is less...
AbstractIn this paper is proved that any simple 3-polytope, all of whose edges are incident with eit...