Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Szigeti, Zoltán - Laboratoire des Sciences pour la Conception, l'Optimisation et la Production de Grenoble & Institut polytechnique de Grenoble
Hypergraph connectivity augmentation Zoltan Szigeti +
ON PACKING PATHS IN PLANAR GRAPHS ANDRAS FRANK and ZOLTAN SZIGETI
ON PACKING T-CUTS Andras Frank and Zoltan Szigeti
A Characterization of Seymour Graphs A. A. Ageev
An Orientation Theorem with Parity Conditions Andras Frank
On the graphic matroid parity problem Zoltan Szigeti
On a min-max theorem on bipartite graphs Zoltan Szigeti
Simultaneous well-balanced orientations of Zoltan Kiraly 1,2
Perfect matchings versus odd cuts Zoltan Szigeti #
Recent results on well-balanced orientations Attila Bernath
Improving on the 1.5-Approximation of a Smallest 2-Edge Connected Spanning Subgraph
On generalizations of matching-covered graphs Zoltan Szigeti
Covering symmetric semi-monotone functions Roland Grappe
Edge-splittings preserving local edge-connectivity of graphs
ON A MATROID DEFINED BY EAR-DECOMPOSITIONS OF GRAPHS ZOLTAN SZIGETI *
The two ear theorem on matching-covered graphs Zoltan Szigeti
Edge-connectivity augmentation of graphs over symmetric parity families
Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph
40 CHAPITRE 1. GRAPHES NON ORIENTS Un arbre est un graphe connexe sans cycle. En particulier, les chanes lmentaires et les
Elsevier Editorial System(tm) for Discrete Applied Mathematics Manuscript Draft
Packing of 2-Connected Spanning Subgraphs and Spanning Trees Joseph Cheriyan
