2026-06-27T18:41:41Z https://meral.edu.mm/oai

oai:meral.edu.mm:recid/751 2021-12-13T07:58:52Z 1582963739756:1582967046255 user-um

Characterization of Bipartite Graph and its Hamiltonicity Shwin Seinn 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. 2008 http://hdl.handle.net/20.500.12678/0000000751 https://meral.edu.mm/records/751