László Szegő

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Matchings of cycles and paths in directed graphs Combinatorica	2007-11-12	Paper
A note on \([k,l\)-sparse graphs]	2007-03-05	Paper
On constructive characterizations of \((k,l)\)-sparse graphs European Journal of Combinatorics	2006-11-15	Paper
An integer programming approach to routing in daisy networks Networks	2006-05-16	Paper
Integer Programming and Combinatorial Optimization Lecture Notes in Computer Science	2005-12-23	Paper
On the maximum even factor in weakly symmetric graphs Journal of Combinatorial Theory. Series B	2004-08-06	Paper
A Gallai–Edmonds‐type structure theorem for path‐matchings Journal of Graph Theory	2004-08-04	Paper
Constructive characterizations for packing and covering with trees Discrete Applied Mathematics	2003-10-14	Paper
Note on the path‐matching formula Journal of Graph Theory	2003-03-19	Paper
scientific article; zbMATH DE number 1757954 (Why is no real title available?)	2002-06-20	Paper
On covering intersecting set-systems by digraphs Discrete Mathematics	2001-07-02	Paper

Research outcomes over time

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