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.
Type de document :
Communication dans un congrès
Stefan Felsner. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), pp.345-350, 2005, DMTCS Proceedings
Liste complète des métadonnées

Littérature citée [8 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01184433
Contributeur : Coordination Episciences Iam <>
Soumis le : vendredi 14 août 2015 - 14:58:39
Dernière modification le : vendredi 8 décembre 2017 - 18:04:01
Document(s) archivé(s) le : dimanche 15 novembre 2015 - 11:10:52

Fichier

dmAE0167.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

  • HAL Id : hal-01184433, version 1

Collections

Citation

Gyula Y. Katona. Hamiltonian Chains in Hypergraphs. Stefan Felsner. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), pp.345-350, 2005, DMTCS Proceedings. 〈hal-01184433〉

Partager

Métriques

Consultations de la notice

235

Téléchargements de fichiers

125