HAMILTONICITY OF BIPARTITE BICLAW-FREE GRAPHS

We define a simple bipartite graph to be biclaw-free if it contains no induced subgraph isomorphic to H, where H can be obtained from two co pies of K1,3 by adding an edge between the two vertices of degree 3. W e show that every connected bipartite biclaw-free graph with minimum d egree delta greater-than-or-equal-to 6 has connectivity at least delta - 2 and that every connected balanced bipartite biclaw-free graph wit h minimum degree delta greater-than-or-equal-to 9 and order n less-tha n-or-equal-to 6delta - 14 is hamiltonian.