A good algorithm for the computation of the edge-integrity of trees. Variations on a theorem of Petersen. On the edge-integrity of graphs. Uniquely realizable score lists in bipartite tournaments. On superstrong bipartite tournaments.
Connection digraphs and second-order line digraphs.
The cochromatic index of a graph. On the crossing numbers of products of cycles and graphs of order four. Consistent graphs with signed points. 260-269 05C20 On line graphs with crossing number 1. On small graphs critical with respect to edge colourings.