Longest cycles in certain bipartite graphs

Pak-Ken Wong

International Journal of Mathematics and Mathematical Sciences, 1998, vol. 21, 1-4

Abstract:

Let G be a connected bipartite graph with bipartition ( X , Y ) such that | X | ≥ | Y | ( ≥ 2 ) , n = | X | and m = | Y | . Suppose, for all vertices x ∈ X and y ∈ Y , dist ( x , y ) = 3 implies d ( x ) + d ( y ) ≥ n + 1 . Then G contains a cycle of length 2 m . In particular, if m = n , then G is hamiltomian.

Date: 1998
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/21/406919.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/21/406919.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:406919

DOI: 10.1155/S0161171298000131

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().