{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T07:18:30Z","timestamp":1648970310072},"reference-count":5,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2001,8]]},"abstract":"<jats:p> Let G be a connected bipartite graph with with bipartition (X, Y) such that |X| \u2265 |Y| (\u2265 2). Put n = |X|, m = |Y| and l = m + n. Suppose that, for all vertices x \u2208 X and y \u2208 Y, dist(x,y) = 3 implies d(x) + d(y) \u2265 n + 1. We show that G contains a cycle of length 2m. We also give an efficient algorithm to obtain such a cycle. The complexity of this algorithm is O(l<jats:sup>3<\/jats:sup>). In case m = n, we find a hamiltonian cycle of G. This generalizes a result given in [10]. <\/jats:p>","DOI":"10.1142\/s0129054101000588","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T10:59:39Z","timestamp":1027767579000},"page":"445-454","source":"Crossref","is-referenced-by-count":0,"title":["AN ALGORITHM FOR FINDING LONGEST CYCLES IN CERTAIN BIPARTITE GRAPHS"],"prefix":"10.1142","volume":"12","author":[{"given":"PAK-KEN","family":"WONG","sequence":"first","affiliation":[{"name":"Department of Mathematics and Computer Science, Seton Hall University, South Orange, N. J. 07079, USA"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"p_2","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(89)90012-6"},{"key":"p_3","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539791200375"},{"key":"p_5","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(84)90054-6"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190150204"},{"key":"p_10","doi-asserted-by":"publisher","DOI":"10.1142\/S012905419600021X"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054101000588","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:46:26Z","timestamp":1565138786000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054101000588"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,8]]},"references-count":5,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2001,8]]}},"alternative-id":["10.1142\/S0129054101000588"],"URL":"https:\/\/doi.org\/10.1142\/s0129054101000588","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,8]]}}}