 | 2006 |
|---|
| 9 |       | Adam Idzik,
Konstanty Junosza-Szaniawski:
Combinatorial lemmas for polyhedrons I.
Discussiones Mathematicae Graph Theory 26(3): 439-448 (2006) |
| 2005 |
|---|
| 8 | | Adam Idzik:
Estimation of cut-vertices in edge-coloured complete graphs.
Discussiones Mathematicae Graph Theory 25(1-2): 217-218 (2005) |
| 7 | | Adam Idzik,
Konstanty Junosza-Szaniawski:
Combinatorial Lemmas for Polyhedrons.
Discussiones Mathematicae Graph Theory 25(1-2): 95-102 (2005) |
| 2001 |
|---|
| 6 | | Adam Idzik,
Zsolt Tuza:
Heredity properties of connectedness in edge-coloured complete graphs.
Discrete Mathematics 235(1-3): 301-306 (2001) |
| 5 | | Adam Idzik,
Gyula O. H. Katona,
Rajiv Vohra:
Intersecting Balanced Families of Sets.
J. Comb. Theory, Ser. A 93(2): 281-291 (2001) |
| 1999 |
|---|
| 4 | | 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) |
| 3 | | Stanislaw Bylka,
Adam Idzik,
Jan Komar:
Bipartite Subgraphs of Graphs with Maximum Degree Three.
Graphs and Combinatorics 15(2): 129-136 (1999) |
| 1990 |
|---|
| 2 | | Adam Idzik:
Communication in m-connected graphs.
Discrete Applied Mathematics 28(3): 297-301 (1990) |
| 1987 |
|---|
| 1 | | Adam Idzik,
Jan Komar,
Marcin Malawski:
Edge-coloured complete graphs: Connectedness of some subgraphs.
Discrete Mathematics 66(1-2): 119-125 (1987) |
Data released under the ODC-BY 1.0 license — See also our legal information page