SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
On some intriguing problems in hamiltonian graph theory: a survey
Discrete Mathematics
Hamiltonian iterated line graphs
Discrete Mathematics
Every 3-connected, essentially 11-connected line graph is Hamiltonian
Journal of Combinatorial Theory Series B
Note: Hamiltonicity of 6-connected line graphs
Discrete Applied Mathematics
Journal of Combinatorial Theory Series B
Hamilton cycles in 5-connected line graphs
European Journal of Combinatorics
Collapsible graphs and Hamiltonian connectedness of line graphs
Discrete Applied Mathematics
Beautiful conjectures in graph theory
European Journal of Combinatorics
Hi-index | 0.05 |