Hamiltonian circuits in certain prisms. - Moshe Rosenfeld 001; David W. Barnette (Discret. Math., 1973)

On embedding triangle-free graphs in unit spheres. - Brian Alspach; Moshe Rosenfeld 001 (Discret. Math., 1977)

Realization of certain generalized paths in tournaments. - Brian Alspach; Moshe Rosenfeld 001 (Discret. Math., 1981)

A result on Hamiltonian cycles in generalized Petersen graphs. - Brian Alspach; Peter J. Robinson 001; Moshe Rosenfeld 001 (J. Comb. Theory B, 1981)

The Complexity of Finding Generalized Paths in Tournaments. - Pavol Hell; Moshe Rosenfeld 001 (J. Algorithms, 1983)

On Hamilton decompositions of prisms over simple 3-polytopes. - Brian Alspach; Moshe Rosenfeld 001 (Graphs Comb., 1986)

On spanning subgraphs of 4-connected planar graphs. - Moshe Rosenfeld 001 (Discret. Appl. Math., 1989)

Almost Orthogonal Lines in Ed. - Moshe Rosenfeld 001 (Applied Geometry And Discrete Mathematics, 1990)

The number of cycles in 2-factors of cubic graphs. - Moshe Rosenfeld 001 (Discret. Math., 1990)

Finding an Antidirected Hamiltonian Path Starting with a Forward Arc from a Given Vertex of a Tournament. - Evripidis Bampis; Pavol Hell; Yannis Manoussakis; Moshe Rosenfeld 001 (Combinatorics and Computer Science, 1995)

Graceful matchings in finite fields, the factor-difference sets of integers, and integers of the form a2 + kb2. - Moshe Rosenfeld 001 (Contemporary Trends in Discrete Mathematics, 1997)

Ubiquitous Angles in Equiangular Sets of Lines. - Barry Guiduli; Moshe Rosenfeld 001 (Discret. Comput. Geom., 2000)

I. Schur, C.E. Shannon and Ramsey Numbers, a short story. - Jaroslav Nesetril; Moshe Rosenfeld 001 (Discret. Math., 2001)

Antidirected hamiltonian paths between specified vertices of a tournament. - Pavol Hell; Moshe Rosenfeld 001 (Discret. Appl. Math., 2002)

Hamiltonian decompositions of prisms over cubic graphs. - Roman Cada; Tomás Kaiser; Moshe Rosenfeld 001; Zdenek Ryjácek (Discret. Math., 2004)

The Prism Over the Middle-levels Graph is Hamiltonian. - Peter Horák; Tomás Kaiser; Moshe Rosenfeld 001; Zdenek Ryjácek (Order, 2005)

A "simple" rectangular puzzle. - Moshe Rosenfeld 001 (Electron. Notes Discret. Math., 2007)

Hamilton cycles in prisms. - Tomás Kaiser; Zdenek Ryjácek; Daniel Král; Moshe Rosenfeld 001; Heinz-Jürgen Voss (J. Graph Theory, 2007)

Some of my favorite "lesser known" problems. - Moshe Rosenfeld 001 (Ars Math. Contemp., 2008)

The Odd-Distance Plane Graph. - Hayri Ardal; Ján Manuch; Moshe Rosenfeld 001; Saharon Shelah; Ladislav Stacho (Discret. Comput. Geom., 2009)

Spanning cubic graph designs. - Peter Adams 001; Hayri Ardal; Ján Manuch; Vu Dinh Hoa; Moshe Rosenfeld 001; Ladislav Stacho (Discret. Math., 2009)

Disjoint Hamilton cycles in the star graph. - Roman Cada; Tomás Kaiser; Moshe Rosenfeld 001; Zdenek Ryjácek (Inf. Process. Lett., 2009)

In Praise of the Gram Matrix. - Moshe Rosenfeld 001 (The Mathematics of Paul Erdős I, 2013)

Cubic factorizations. - Moshe Rosenfeld 001; Vu Dinh Hoa (Discret. Math., 2013)

Forbidden Subgraphs of the Odd-Distance Graph. - Moshe Rosenfeld 001; Nam Lê Tien (J. Graph Theory, 2014)

Every 3-colorable graph has a faithful representation in the odd-distance graph. - Tien-Nam Le; Fiachra Knox; Moshe Rosenfeld 001 (Discret. Math., 2015)

A new labeling of C2n proves that K4 + M6n decomposes K6n+4. - Vu Dinh Hoa; Moshe Rosenfeld 001 (Ars Comb., 2018)