Connected graphs without long paths. Discrete Mathematics. 2008;308(19):4487-94.
Adjacent vertex distinguishing edge-colorings. SIAM Journal on Discrete Mathematics. 2007;21(1):237-50.
Longest paths in circular arc graphs. Combinatorics, Probability and Computing. 2004;13(3):311-7.