Skip to Main content Skip to Navigation
Conference papers

Hamiltonian Chains in Hypergraphs

Abstract : Hamiltionian chain is a generalisation of hamiltonian cycles for hypergraphs. Among the several possible ways of generalisations this is probably the most strong one, it requires the strongest structure. Since there are many interesting questions about hamiltonian cycles in graphs, we can try to answer these questions for hypergraphs, too. In the present article we give a survey on results about such questions.
Complete list of metadata

Cited literature [8 references]  Display  Hide  Download

https://hal.inria.fr/hal-01184433
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Friday, August 14, 2015 - 2:58:39 PM
Last modification on : Friday, December 8, 2017 - 6:04:01 PM
Long-term archiving on: : Sunday, November 15, 2015 - 11:10:52 AM

File

dmAE0167.pdf
Publisher files allowed on an open archive

Identifiers

Collections

Citation

Gyula Y. Katona. Hamiltonian Chains in Hypergraphs. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. pp.345-350, ⟨10.46298/dmtcs.3444⟩. ⟨hal-01184433⟩

Share

Metrics

Record views

48

Files downloads

533