An Extension of a Theorem of Henneberg and Laman. - András Frank; László Szegö (IPCO, 2001)

On covering intersecting set-systems by digraphs. - László Szegö (Discret. Math., 2001)

Note on the path-matching formula. - András Frank; László Szegö (J. Graph Theory, 2002)

Constructive characterizations for packing and covering with trees. - András Frank; László Szegö (Discret. Appl. Math., 2003)

The Path-Packing Structure of Graphs. - András Sebö; László Szegö (IPCO, 2004)

On the maximum even factor in weakly symmetric graphs. - Gyula Pap; László Szegö (J. Comb. Theory B, 2004)

A Gallai-Edmonds-type structure theorem for path-matchings. - Bianca Spille; László Szegö (J. Graph Theory, 2004)

On constructive characterizations of (k, l)-sparse graphs. - László Szegö (Eur. J. Comb., 2006)

An integer programming approach to routing in daisy networks. - Johanna Becker; Zsolt Csizmadia; Jérôme Galtier; Alexandre Laugier; Jácint Szabó; László Szegö (Networks, 2006)

Matchings of cycles and paths in directed graphs. - Gyula Pap; László Szegö (Comb., 2007)

Balancing congestion for unsplittable routing on a bidirected ring - Johanna Becker; Zsolt Csizmadia; Alexandre Laugier; Jácint Szabó; László Szegö (CoRR, 2010)