Please use this identifier to cite or link to this item:
Characterization of a Bipartite Graph and Its Hamiltonicity
- In this paper, the characterization of a 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 necessary condition will be shown for the Hamiltonicity of a complete bipartite graph.
- Universities Research Journal (URJ)