Hamiltonian Chains in Hypergraphs

Gyula Y. Katona (1)

1 DCSIT - Department of Computer Science and Information Theory

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.

Mots clés: Hamiltonian cycle; hypergraph

Domaines: Mathématique discrète [cs.DM]; Combinatoire [math.CO]

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⟩