By constructing sequences of non-Hamiltonian graphs it is proved that (1) for k ⩾ 4, the class of k-connected k-valent bipartite graphs has shortness exponent less than one and (2) the class of cyclically 4-edge-connected trivalent bipartite graphs has shortness coefficient less than one
AbstractIn the class of all 5-regular multitriangular polyhedral graphs there exists a nonhamiltonia...
We give a sufficient condition for a distance-regular graph to be Hamiltonian. In particular, the Pe...
A graph is called weakly pancyclic if it contains cycles of all lengths between its girth and circum...
By constructing sequences of non-Hamiltonian graphs it is proved that (1) for k ⩾ 4, the class of k-...
AbstractThis paper is concerned with non-Hamiltonian planar graphs. It is shown that the class of 3-...
AbstractThe class of 3-connected bipartite cubic graphs is shown to contain a non-Hamiltonian graph ...
AbstractThe class of 3-connected bipartite cubic graphs is shown to contain a non-Hamiltonian graph ...
This chapter presents the theorem of Hamiltonian cycles in regular graphs. If in a graph of order n ...
AbstractWe consider two classes of simple 3-polytopal graphs whose edges are incident with either tw...
AbstractGeneralizing a result of Häggkvist et al. (1981), we prove that every non-bipartite graph of...
AbstractA graph is short-chroded (a.k.a. Raspail) if every odd cycle of length at least 5 has a shor...
AbstractIt is shown that the shortness exponent of the class of 1-tough, maximal planar graphs is at...
Motivated by work of Haythorpe, Thomassen and the author showed that there exists a positive constan...
AbstractWe consider the class of simple 3-polytopes the faces of which are only triangles and 7-gons...
We give a sufficient condition for a distance-regular graph to be Hamiltonian. In particular, the Pe...
AbstractIn the class of all 5-regular multitriangular polyhedral graphs there exists a nonhamiltonia...
We give a sufficient condition for a distance-regular graph to be Hamiltonian. In particular, the Pe...
A graph is called weakly pancyclic if it contains cycles of all lengths between its girth and circum...
By constructing sequences of non-Hamiltonian graphs it is proved that (1) for k ⩾ 4, the class of k-...
AbstractThis paper is concerned with non-Hamiltonian planar graphs. It is shown that the class of 3-...
AbstractThe class of 3-connected bipartite cubic graphs is shown to contain a non-Hamiltonian graph ...
AbstractThe class of 3-connected bipartite cubic graphs is shown to contain a non-Hamiltonian graph ...
This chapter presents the theorem of Hamiltonian cycles in regular graphs. If in a graph of order n ...
AbstractWe consider two classes of simple 3-polytopal graphs whose edges are incident with either tw...
AbstractGeneralizing a result of Häggkvist et al. (1981), we prove that every non-bipartite graph of...
AbstractA graph is short-chroded (a.k.a. Raspail) if every odd cycle of length at least 5 has a shor...
AbstractIt is shown that the shortness exponent of the class of 1-tough, maximal planar graphs is at...
Motivated by work of Haythorpe, Thomassen and the author showed that there exists a positive constan...
AbstractWe consider the class of simple 3-polytopes the faces of which are only triangles and 7-gons...
We give a sufficient condition for a distance-regular graph to be Hamiltonian. In particular, the Pe...
AbstractIn the class of all 5-regular multitriangular polyhedral graphs there exists a nonhamiltonia...
We give a sufficient condition for a distance-regular graph to be Hamiltonian. In particular, the Pe...
A graph is called weakly pancyclic if it contains cycles of all lengths between its girth and circum...
DOI
Add to ORKG