Moshe Rosenfeld

According to our database, Moshe Rosenfeld authored at least 27 papers between 1973 and 2018.

Collaborative distances:

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

2018

A new labeling of C2n proves that K4 + M6n decomposes K6n+4.

Vu Dinh Hoa, Moshe Rosenfeld

Ars Comb., 2018

2015

Every 3-colorable graph has a faithful representation in the odd-distance graph.

Tien-Nam Le, Fiachra Knox, Moshe Rosenfeld

Discret. Math., 2015

2014

Forbidden Subgraphs of the Odd-Distance Graph.

Moshe Rosenfeld, Nam Lê Tien

J. Graph Theory, 2014

2013

Cubic factorizations.

Moshe Rosenfeld, Vu Dinh Hoa

Discret. Math., 2013

In Praise of the Gram Matrix.

Moshe Rosenfeld

Proceedings of the Mathematics of Paul Erdős I, 2013

2009

Disjoint Hamilton cycles in the star graph.

Roman Cada, Tomás Kaiser, Moshe Rosenfeld, Zdenek Ryjácek

Inf. Process. Lett., 2009

Spanning cubic graph designs.

Peter Adams, Hayri Ardal, Ján Manuch, Vu Dinh Hoa, Moshe Rosenfeld, Ladislav Stacho

Discret. Math., 2009

The Odd-Distance Plane Graph.

Hayri Ardal, Ján Manuch, Moshe Rosenfeld, Saharon Shelah, Ladislav Stacho

Discret. Comput. Geom., 2009

2008

Some of my favorite "lesser known" problems.

Moshe Rosenfeld

Ars Math. Contemp., 2008

2007

Hamilton cycles in prisms.

Tomás Kaiser, Zdenek Ryjácek, Daniel Král, Moshe Rosenfeld, Heinz-Jürgen Voss

J. Graph Theory, 2007

A "simple" rectangular puzzle.

Moshe Rosenfeld

Electron. Notes Discret. Math., 2007

2005

The Prism Over the Middle-levels Graph is Hamiltonian.

Peter Horák, Tomás Kaiser, Moshe Rosenfeld, Zdenek Ryjácek

Order, 2005

2004

Hamiltonian decompositions of prisms over cubic graphs.

Roman Cada, Tomás Kaiser, Moshe Rosenfeld, Zdenek Ryjácek

Discret. Math., 2004

2002

Antidirected hamiltonian paths between specified vertices of a tournament.

Pavol Hell, Moshe Rosenfeld

Discret. Appl. Math., 2002

2001

I. Schur, C.E. Shannon and Ramsey Numbers, a short story.

Jaroslav Nesetril, Moshe Rosenfeld

Discret. Math., 2001

2000

Ubiquitous Angles in Equiangular Sets of Lines.

Barry Guiduli, Moshe Rosenfeld

Discret. Comput. Geom., 2000

1997

Graceful matchings in finite fields, the factor-difference sets of integers, and integers of the form <i>a² + kb²</i>.

Moshe Rosenfeld

Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997

1995

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

Proceedings of the Combinatorics and Computer Science, 1995

1990

The number of cycles in 2-factors of cubic graphs.

Moshe Rosenfeld

Discret. Math., 1990

Almost Orthogonal Lines in Ed.

Moshe Rosenfeld

Proceedings of the Applied Geometry And Discrete Mathematics, 1990

1989

On spanning subgraphs of 4-connected planar graphs.

Moshe Rosenfeld

Discret. Appl. Math., 1989

1986

On Hamilton decompositions of prisms over simple 3-polytopes.

Brian Alspach, Moshe Rosenfeld

Graphs Comb., 1986

1983

The Complexity of Finding Generalized Paths in Tournaments.

Pavol Hell, Moshe Rosenfeld

J. Algorithms, 1983

1981

A result on Hamiltonian cycles in generalized Petersen graphs.

Brian Alspach, Peter J. Robinson, Moshe Rosenfeld

J. Comb. Theory B, 1981

Realization of certain generalized paths in tournaments.

Brian Alspach, Moshe Rosenfeld

Discret. Math., 1981

1977

On embedding triangle-free graphs in unit spheres.

Brian Alspach, Moshe Rosenfeld

Discret. Math., 1977

1973

Hamiltonian circuits in certain prisms.

Moshe Rosenfeld, David W. Barnette

Discret. Math., 1973