Khaliluzzaman, Md.Islam, Md. MonirulHasan, Md.Monjur2022-07-042022-07-042015-05https://www.researchgate.net/publication/27731157909758887http://dspace.iiuc.ac.bd:8080/xmlui/handle/123456789/3405Volume 117 – No.11, May 2015A graph G (V, E) is said to be Hamiltonian if it contains a spanning cycle. The spanning cycle is called a Hamiltonian cycle of G and G is said to be a Hamiltonian graph. A Hamiltonian path is a path that contains all the vertices in V (G) but does not return to the vertex in which it began. In this paper, we study Hamiltonicity of 3-connected, 3-regular planar bipartite graph G with partite sets V=M  N. We shall prove that G has a Hamiltonian cycle if G is balanced with M = N. For that we present an algorithm for a bipartite graph KM,N where M>3, N>3 and M,N both are even to possess a Hamiltonian cycle. In particular, we also prove a theorem for S proper subset (M or N) of V the number of components W (G-S) = S implies the graph has a Hamiltonian pathenHamiltonian CycleBipartite3-connected3-regularProper subsetHamiltonian pathArticle