| 2007 |
|---|
| 11 | EE | Moshe Rosenfeld:
A "simple" rectangular puzzle.
Electronic Notes in Discrete Mathematics 28: 409-415 (2007) |
| 10 | EE | Tomás Kaiser,
Zdenek Ryjácek,
Daniel Král,
Moshe Rosenfeld,
Heinz-Jürgen Voss:
Hamilton cycles in prisms.
Journal of Graph Theory 56(4): 249-269 (2007) |
| 2005 |
|---|
| 9 | EE | Peter Horák,
Tomás Kaiser,
Moshe Rosenfeld,
Zdenek Ryjácek:
The Prism Over the Middle-levels Graph is Hamiltonian.
Order 22(1): 73-81 (2005) |
| 2004 |
|---|
| 8 | EE | Roman Cada,
Tomás Kaiser,
Moshe Rosenfeld,
Zdenek Ryjácek:
Hamiltonian decompositions of prisms over cubic graphs.
Discrete Mathematics 286(1-2): 45-56 (2004) |
| 2002 |
|---|
| 7 | | Pavol Hell,
Moshe Rosenfeld:
Antidirected hamiltonian paths between specified vertices of a tournament.
Discrete Applied Mathematics 117(1-3): 87-98 (2002) |
| 2001 |
|---|
| 6 | EE | Jaroslav Nesetril,
Moshe Rosenfeld:
I. Schur, C.E. Shannon and Ramsey Numbers, a short story.
Discrete Mathematics 229(1-3): 185-195 (2001) |
| 1995 |
|---|
| 5 | | Evripidis Bampis,
Pavol Hell,
Yannis Manoussakis,
Moshe Rosenfeld:
Finding an Antidirected Hamiltonian Path Starting with a Forward Arc from a Given Vertex of a Tournament.
Combinatorics and Computer Science 1995: 67-73 |
| 1990 |
|---|
| 4 | EE | Moshe Rosenfeld:
The number of cycles in 2-factors of cubic graphs.
Discrete Mathematics 84(3): 285-294 (1990) |
| 1989 |
|---|
| 3 | EE | Moshe Rosenfeld:
On spanning subgraphs of 4-connected planar graphs.
Discrete Applied Mathematics 25(3): 279-287 (1989) |
| 1983 |
|---|
| 2 | | Pavol Hell,
Moshe Rosenfeld:
The Complexity of Finding Generalized Paths in Tournaments.
J. Algorithms 4(4): 303-309 (1983) |
| 1981 |
|---|
| 1 | EE | Brian Alspach,
Moshe Rosenfeld:
Realization of certain generalized paths in tournaments.
Discrete Mathematics 34(2): 199-202 (1981) |
