1. Cycle decompositions, 2-coverings, removable cycles, and the four-color-disease, in: and (Eds), Progress in Graph Theory, Academic Press, Toronto, ON, 1984, pp. 233–246.
2. Disjoint T-paths in tough graphs, submitted. Preprint: ITI Series 2005–270, Institute for Theoretical Computer Science, Prague, 2005.
3. and , Cycles intersecting edge-cuts of prescribed sizes, submitted. Preprint: ITI Series 2004–225, Institute for Theoretical Computer Science, Prague, 2004.
4. and , Cycles intersecting edge-cuts of prescribed sizes, Extended abstract, EuroComb 2005, DMTCS proc AE (2005), 303–308.
5. A Reduction Method for Edge-Connectivity in Graphs