| |
| 2001 | ||
|---|---|---|
| 5 | EE | Adam Idzik, Zsolt Tuza: Heredity properties of connectedness in edge-coloured complete graphs. Discrete Mathematics 235(1-3): 301-306 (2001) |
| 4 | EE | Adam Idzik, Gyula O. H. Katona, Rajiv Vohra: Intersecting Balanced Families of Sets. J. Comb. Theory, Ser. A 93(2): 281-291 (2001) |
| 1999 | ||
| 3 | EE | Stanislaw Bylka, Adam Idzik, Zsolt Tuza: Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdös inequality. Discrete Mathematics 194(1-3): 39-58 (1999) |
| 1990 | ||
| 2 | EE | Adam Idzik: Communication in m-connected graphs. Discrete Applied Mathematics 28(3): 297-301 (1990) |
| 1987 | ||
| 1 | EE | Adam Idzik, Jan Komar, Marcin Malawski: Edge-coloured complete graphs: Connectedness of some subgraphs. Discrete Mathematics 66(1-2): 119-125 (1987) |
| 1 | Stanislaw Bylka | [3] |
| 2 | Gyula O. H. Katona | [4] |
| 3 | Jan Komar | [1] |
| 4 | Marcin Malawski | [1] |
| 5 | Zsolt Tuza | [3] [5] |
| 6 | Rajiv Vohra | [4] |