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.
Nearly bipartite graphs. Discrete Mathematics. 2003;272(2-3):187-96.
Two-edge colorings of graphs with bounded degree in both colors. Discrete Mathematics. 2002;249(1-3):105-10.
Vertex-Disjoint Cycles Containing Specified Edges. Graphs and Combinatorics. 2000;16(1):81-92.