Longest cycles in certain bipartite graphs
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 2m. In particular, if m=n, then G is hamiltomian.
-д хадгалсан:
| Үндсэн зохиолч: | |
|---|---|
| Формат: | Artigo |
| Хэл сонгох: | Inglês |
| Хэвлэсэн: |
Wiley
1998-01-01
|
| Цуврал: | International Journal of Mathematics and Mathematical Sciences |
| Нөхцлүүд: | |
| Онлайн хандалт: | http://dx.doi.org/10.1155/S0161171298000131 |
| Шошгууд: |
Шошго байхгүй, Энэхүү баримтыг шошголох эхний хүн болох!
|