Please use this identifier to cite or link to this item:
Characterization of Bipartite Graph and its Hamiltonicity
- In this paper, the characterization of bipartite graph will be first described by using the definitions of cycle, Hamiltonian cycle, odd cycle, and chromatic number in a graph. Then, the conditions for a bipartite graph to be Hamiltonian are investigated. Furthermore, a new necessary condition will be shown for the Hamiltonicity of bipartite graph.
- Universities Research Journal, Department of Higher Education