Add to ORKGWe give a sufficient condition for a distance-regular graph to be Hamiltonian. In particular, the Petersen graph is the only connected non-Hamiltonian strongly regular graph on fewer than 99 vertices
AbstractIn this paper we identify large classes of directed and undirected graphs, not necessarily c...
We study graph theory. A graph is composed by a vertex set and an edge set, and each edge joins an u...
AbstractThe toughness of a graph G is defined as the largest real number t such that deletion of any...
We give a sufficient condition for a distance-regular graph to be Hamiltonian. In particular, the Pe...
We give a sufficient condition for a distance-regular graph to be Hamiltonian. In particular, the Pe...
In 1980, Jackson proved that every 2-connected k-regular graph with at most 3k vertices is Hamiltoni...
DeLeon 1 A graph G is Hamiltonian if it has a spanning cycle. The problem of determining if a graph ...
Let G(k) denote the set of connected k-regular graphs G, k ≥ 2, where the number of vertices at dist...
We survey results and open problems in Hamiltonian graph theory centred around three themes: regular...
This chapter presents the theorem of Hamiltonian cycles in regular graphs. If in a graph of order n ...
We survey results and open problems in hamiltonian graph theory centered around three themes: regula...
AbstractBill Jackson has proved that every 2-connected, k-regular graph on at most 3k vertices is ha...
AbstractWe give a simpler proof of the theorem due to B. Jackson and Y. Zhu, Z. Liu, and Z. Yu that,...
AbstractWe survey results and open problems in hamiltonian graph theory centered around three themes...
A graph is uniquely hamiltonian if it contains exactly one hamiltonian cycle. In this note we prove ...
AbstractIn this paper we identify large classes of directed and undirected graphs, not necessarily c...
We study graph theory. A graph is composed by a vertex set and an edge set, and each edge joins an u...
AbstractThe toughness of a graph G is defined as the largest real number t such that deletion of any...
We give a sufficient condition for a distance-regular graph to be Hamiltonian. In particular, the Pe...
We give a sufficient condition for a distance-regular graph to be Hamiltonian. In particular, the Pe...
In 1980, Jackson proved that every 2-connected k-regular graph with at most 3k vertices is Hamiltoni...
DeLeon 1 A graph G is Hamiltonian if it has a spanning cycle. The problem of determining if a graph ...
Let G(k) denote the set of connected k-regular graphs G, k ≥ 2, where the number of vertices at dist...
We survey results and open problems in Hamiltonian graph theory centred around three themes: regular...
This chapter presents the theorem of Hamiltonian cycles in regular graphs. If in a graph of order n ...
We survey results and open problems in hamiltonian graph theory centered around three themes: regula...
AbstractBill Jackson has proved that every 2-connected, k-regular graph on at most 3k vertices is ha...
AbstractWe give a simpler proof of the theorem due to B. Jackson and Y. Zhu, Z. Liu, and Z. Yu that,...
AbstractWe survey results and open problems in hamiltonian graph theory centered around three themes...
A graph is uniquely hamiltonian if it contains exactly one hamiltonian cycle. In this note we prove ...
AbstractIn this paper we identify large classes of directed and undirected graphs, not necessarily c...
We study graph theory. A graph is composed by a vertex set and an edge set, and each edge joins an u...
AbstractThe toughness of a graph G is defined as the largest real number t such that deletion of any...