Grzegorz Gancarzewicz

According to our database, Grzegorz Gancarzewicz authored at least 4 papers between 2000 and 2009.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2009

A degree condition implying that every matching is contained in a hamiltonian cycle.

Denise Amar, Evelyne Flandrin, Grzegorz Gancarzewicz

Discret. Math., 2009

2007

Bipartite graphs with every matching in a cycle.

Denise Amar, Evelyne Flandrin, Grzegorz Gancarzewicz, A. Pawel Wojda

Discret. Math., 2007

2005

Hamiltonian cycles and paths through matchings.

Denise Amar, Evelyne Flandrin, Grzegorz Gancarzewicz

Electron. Notes Discret. Math., 2005

2000

Graphs with every <i>k</i>-matching in a Hamiltonian cycle.

Grzegorz Gancarzewicz, A. Pawel Wojda

Discret. Math., 2000