Joseph Zaks
Abstract
Open-access reader
Let V(G) and E(G) denote the vertex set and the edge set of a graph G; let Kn denote the complete graph with n vertices and let Kn, m denote the complete bipartite graph on n and m vertices. A Hamiltonian cycle (Hamiltonian path, respectively) in a graph G is a cycle (path, respectively) in G that contains all the vertices of G.
OpenAlex reports 9 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Let V(G) and E(G) denote the vertex set and the edge set of a graph G; let Kn denote the complete graph with n vertices and let Kn, m denote the complete bipartite graph on n and m vertices. A Hamiltonian cycle (Hamiltonian path, respectively) in a graph G is a cycle (path, respectively) in G that contains all the vertices of G.
Key concepts: Mathematics, Combinatorics, Hamiltonian path, Wheel graph, Bipartite graph, Pancyclic graph, Vertex (graph theory), Graph power