On some intriguing problems in hamiltonian graph theory: a survey
Discrete Mathematics
Spanning Trees with Bounded Number of Branch Vertices
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Hamiltonian properties on the class of hypercube-like networks
Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
On the hamiltonicity of the cartesian product
Information Processing Letters
An efficient condition for a graph to be Hamiltonian
Discrete Applied Mathematics
Chvátal---Erdős Theorem: Old Theorem with New Aspects
Computational Geometry and Graph Theory
A clique-covering sufficient condition for hamiltonicity of graphs
Information Processing Letters
On the hamiltonicity of the cartesian product
Information Processing Letters
There are spanning spiders in dense graphs (and we know how to find them)
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Pancyclicity of Hamiltonian and highly connected graphs
Journal of Combinatorial Theory Series B
Hamiltonian property on binary recursive networks
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
Normal eulerian clique-covering and hamiltonicity
Information Processing Letters
An effective algorithm for and phase transitions of the directed hamiltonian cycle problem
Journal of Artificial Intelligence Research
A SAT based effective algorithm for the directed hamiltonian cycle problem
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Hamiltonicity and Pancyclicity of binary recursive networks
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
| Hi-index | 0.00 |