15 search results - page 1 / 3 » Hamiltonian Chains in Hypergraphs |
DM
2010
13 years 5 months ago
2010
We say that a hypergraph H is hamiltonian path (cycle) saturated if H does not contain an open (closed) hamiltonian chain but by adding any new edge we create an open (closed) ham...
ENDM
2006
13 years 4 months ago
2006
DM
2010
13 years 5 months ago
2010
Using a generalisation of Hamiltonian cycles to uniform hypergraphs due to Katona and Kierstead, we define a new notion of a Hamiltonian decomposition of a uniform hypergraph. We ...
LATIN
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. We study the computational complexity of deciding the existence of a Hamiltonian Cycle in some dense classes of k-uniform hypergraphs. Those problems turned out to be, al...
FCT
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We analyse the mixing time of Markov chains using path coupling with stopping times. We apply this approach to two hypergraph problems. We show that the Glauber dynamics ...