Hamiltonian Chains in Hypergraphs
Résumé
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.
Origine | Fichiers éditeurs autorisés sur une archive ouverte |
---|
Loading...