In [1] the concepts of paths and cycles of a hypergraph were introduced. In this paper, we give the concepts for bipartite hypergraph and Hamiltonian paths and cycles of a hypergraph, and prove that the complete bipar...In [1] the concepts of paths and cycles of a hypergraph were introduced. In this paper, we give the concepts for bipartite hypergraph and Hamiltonian paths and cycles of a hypergraph, and prove that the complete bipartite 3-hypergraph with q vertices in earh part is Hamiltonian decomposable where q is a prime.展开更多
In this paper, it is proved that any connected Cayley graph on an abelian group of order pq or p~2 has a hamiltonian decomposition, where p and q are odd primes. This result answers partially a conjecture of Alspach c...In this paper, it is proved that any connected Cayley graph on an abelian group of order pq or p~2 has a hamiltonian decomposition, where p and q are odd primes. This result answers partially a conjecture of Alspach concerning hamiltonian decomposition of 2k-regular connected Cayley graphs on abelian groups.展开更多
基金the National Natural Science Foundation of China (No.19831080).
文摘In [1] the concepts of paths and cycles of a hypergraph were introduced. In this paper, we give the concepts for bipartite hypergraph and Hamiltonian paths and cycles of a hypergraph, and prove that the complete bipartite 3-hypergraph with q vertices in earh part is Hamiltonian decomposable where q is a prime.
文摘In this paper, it is proved that any connected Cayley graph on an abelian group of order pq or p~2 has a hamiltonian decomposition, where p and q are odd primes. This result answers partially a conjecture of Alspach concerning hamiltonian decomposition of 2k-regular connected Cayley graphs on abelian groups.
