#### Filter Results:

- Full text PDF available (33)

#### Publication Year

1972

2018

- This year (3)
- Last 5 years (11)
- Last 10 years (23)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

In the well-solved edge-connectivity augmentation proble m we must find a minimum cardinality setF of edges to add to a given undirected graph to make it -edge-connected. This paper solves the… (More)

- Zoltán Szigeti
- Math. Program.
- 1999

The hypergraph augmentation problem is to augment a hypergraph by hyperedges to meet prescribed local connectivity requirements. We provide here a minimax theorem for this problem. The result is… (More)

- Joseph Cheriyan, András Sebö, Zoltán Szigeti
- SIAM J. Discrete Math.
- 2001

We give a 17 12 -approximation algorithm for the following NP-hard problem: Given a simple undirected graph, nd a 2-edge connected spanning subgraph that has the minimum number of edges. The best… (More)

- Olivier Durand de Gevigney, Viet Hang Nguyen, Zoltán Szigeti
- SIAM J. Discrete Math.
- 2013

We provide the directed counterpart of a slight extension of Katoh and Tanigawa’s result [8] on rooted-tree decompositions with matroid constraints. Our result characterizes digraphs having a packing… (More)

- Zoltán Szigeti
- IPCO
- 1993

- Tibor Jordán, Zoltán Szigeti
- SIAM J. Discrete Math.
- 2003

Let G = (V + s,E) be a graph and let S = (d1, ..., dp) be a set of positive integers with ∑ dj = d(s). An S-detachment splits into a set ofp independent vertices1, ..., sp with d(sj) = dj , 1 ≤ j ≤… (More)

- András Frank, Tibor Jordán, Zoltán Szigeti
- IPCO
- 1999

Given a graphG = (V, E) and a set T ⊆ V , an orientation ofG is calledT -odd if precisely the vertices of T get odd in-degree. We give a good characterization for the existence of a T -odd… (More)

- Katalin Páldi, Ilona Rácz, Zoltán Szigeti, Szabolcs Rudnóy
- Biologia Plantarum
- 2013

Maize (Zea mays L.) seedlings were pretreated with 0.001 g dm−3 S-methylmethionine (SMM) in the nutrient solution for 24 h and then subjected to chilling (6 °C for 2, 4, 6, 10, and 24 h). Cold stress… (More)

- Joseph Cheriyan, Olivier Durand de Gevigney, Zoltán Szigeti
- J. Comb. Theory, Ser. B
- 2014

We prove that every (6k + 2`, 2k)-connected simple graph contains k rigid and ` connected edge-disjoint spanning subgraphs. This implies a theorem of Jackson and Jordán [4] and a theorem of Jordán… (More)

- Zoltán Szigeti
- J. Comb. Theory, Ser. B
- 1998

We give a simple and short proof for the two ear theorem on matchingcovered graphs which is a well-known result of Lovász and Plummer. The proof relies only on the classical results of Tutte and Hall… (More)