GRAFOS BIPARTITOS BALANCEADOS HAMILTONIANO Y CONJUNTOS INDEPENDIENTES BALANCEADOS I HAMILTONIAN BALANCED BIPARTITE GRAPHS AND BALANCED INDEPENDENT SETS
Daniel Brito · DOAJ (DOAJ: Directory of Open Access Journals) · 2018
Let G be a balanced bipartite graph of order 2 n , i.e. a graph with a bipartition into two independent vertex sets of the same cardinality n , and minimum degree, i.e. at least number of edges incidents on a vertex, the least four. If for every balanced independent set of four vertices, i.e. an independent set containing two vertices from each side of the bipartition, the number of neighbors is at least n + 1, then G is Hamiltonian.