-
The closed knight tour problem in higher dimensions
This is a merged version of the previous version and the approach of Erde http://arxiv.org/abs/1202.5548 . -
Edge Decompositions of Hypercubes by Paths and by Cycles
International audience -
Supereulerian graphs, Hamiltonicity of graphes and several extremal problems ...
In this thesis, we focus on the following topics: supereulerian graphs, hamiltonian line graphs, fault-tolerant Hamiltonian laceability of Cayley graphs generated by... -
On a family of cubic graphs containing the ower snarks
International audience -
Reconstructing a Hamiltonian Cycle by Querying the Graph: Application to DNA ...
Article dans revue scientifique avec comité de lecture. -
On hamiltonian chain saturated uniform hypergraphs
Graphs and Algorithms
