Resumo

BRITO, Daniel. Hamilltonian balanced bipartite graphs and balanced independent sets. Saber [online]. 2013, vol.25, n.1, pp.35-38. ISSN 1315-0162.

Let G be a balanced bipartite graph of order 2n, 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.

Palavras-chave : Neighborhood union.

        · resumo em Espanhol     · texto em Espanhol     · Espanhol ( pdf )