Search

Your search keyword '"hamiltomian graphs."' showing total 1 results
Start Over Descriptor "hamiltomian graphs." Search Limiters Full Text
1 results on '"hamiltomian graphs."'

1. Longest cycles in certain bipartite graphs

Author

Pak-Ken Wong

Subjects
Bipartite graphs, 2-connected graphs, hamiltomian graphs., Mathematics, QA1-939
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 2m. In particular, if m=n, then G is hamiltomian.

Published
1998
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results