Adam Idzik

According to our database, Adam Idzik authored at least 10 papers between 1987 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2020

Isometric copies of directed trees in orientations of graphs.

Taras O. Banakh, Adam Idzik, Oleg Pikhurko, Igor Protasov, Krzysztof Pszczola

J. Graph Theory, 2020

2006

Combinatorial lemmas for polyhedrons I.

Adam Idzik, Konstanty Junosza-Szaniawski

Discuss. Math. Graph Theory, 2006

2005

Combinatorial Lemmas for Polyhedrons.

Adam Idzik, Konstanty Junosza-Szaniawski

Discuss. Math. Graph Theory, 2005

Estimation of cut-vertices in edge-coloured complete graphs.

Adam Idzik

Discuss. Math. Graph Theory, 2005

2001

Intersecting Balanced Families of Sets.

Adam Idzik, Gyula O. H. Katona, Rajiv Vohra

J. Comb. Theory A, 2001

Heredity properties of connectedness in edge-coloured complete graphs.

Adam Idzik, Zsolt Tuza

Discret. Math., 2001

1999

Bipartite Subgraphs of Graphs with Maximum Degree Three.

Stanislaw Bylka, Adam Idzik, Jan Komar

Graphs Comb., 1999

Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdös inequality.

Stanislaw Bylka, Adam Idzik, Zsolt Tuza

Discret. Math., 1999

1990

Communication in m-connected graphs.

Adam Idzik

Discret. Appl. Math., 1990

1987

Edge-coloured complete graphs: Connectedness of some subgraphs.

Adam Idzik, Jan Komar, Marcin Malawski

Discret. Math., 1987