László Szegő

Available identifiers

Publication	Date of Publication	Type
Matchings of cycles and paths in directed graphs	2007-11-12	Paper
A note on \([k,l]\)-sparse graphs	2007-03-05	Paper
On constructive characterizations of \((k,l)\)-sparse graphs	2006-11-15	Paper
An integer programming approach to routing in daisy networks	2006-05-16	Paper
Integer Programming and Combinatorial Optimization	2005-12-23	Paper
On the maximum even factor in weakly symmetric graphs	2004-08-06	Paper
A Gallai–Edmonds‐type structure theorem for path‐matchings	2004-08-04	Paper
Constructive characterizations for packing and covering with trees	2003-10-14	Paper
Note on the path‐matching formula	2003-03-19	Paper
https://portal.mardi4nfdi.de/entity/Q4537742	2002-06-20	Paper
On covering intersecting set-systems by digraphs	2001-07-02	Paper

This page was built for person: László Szegő