Decomposing Complete 3-Uniform Hypergraph Kn(3) into 7-cycles

DOI

10.2991/lemcs-15.2015.253How to use a DOI?

Keywords

Uniform hypergraph; 7-cycle; Cycle sequence; Cycle decomposition; Hamiltonian cycle

Abstract

This paper studies the definition for a Hamiltonian cycle of Jianfang Wang-Tony Lee and Katona-Kierstead in a uniform hypergraph, respectively. In general, the existence of decomposition in 7-cyces remains open. In this paper, researchers use the method of edge-partition and cycle sequence proposed by Jirimutu and Jianfang Wang. Researchers find a new result.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Yan Hong
AU  - Rimutu Ji
PY  - 2015/07
DA  - 2015/07
TI  - Decomposing Complete 3-Uniform Hypergraph Kn(3) into 7-cycles
BT  - Proceedings of the International Conference on Logistics, Engineering, Management and Computer Science
PB  - Atlantis Press
SP  - 1272
EP  - 1274
SN  - 1951-6851
UR  - https://doi.org/10.2991/lemcs-15.2015.253
DO  - 10.2991/lemcs-15.2015.253
ID  - Hong2015/07
ER  -