Many results have been obtained in investigating the existence of Hamiltonian cycles in 2-connected, k-regular graphs, see [3], [1], [4], [6] and [2].We consider only simple graphs here and use standard graph theory n...Many results have been obtained in investigating the existence of Hamiltonian cycles in 2-connected, k-regular graphs, see [3], [1], [4], [6] and [2].We consider only simple graphs here and use standard graph theory notations and terminology. We let V(G) and E(G) denote the vertex set and the edge set of graph G respectively.展开更多
文摘Many results have been obtained in investigating the existence of Hamiltonian cycles in 2-connected, k-regular graphs, see [3], [1], [4], [6] and [2].We consider only simple graphs here and use standard graph theory notations and terminology. We let V(G) and E(G) denote the vertex set and the edge set of graph G respectively.
