Hamiltonian Chains in Hypergraphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2005

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.
Fichier principal
Vignette du fichier
dmAE0167.pdf (121.58 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01184433 , version 1 (14-08-2015)

Identifiers

Cite

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⟩

Collections

INSMI TDS-MACS
50 View
622 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More