Moshe Rosenfeld

Orcid: 0000-0003-3284-9036

Affiliations:
  • University of Washington, Tacoma, WA, USA
  • Pacific Lutheran University, Tacoma, WA, USA (former)


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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2018
A new labeling of C2n proves that K4 + M6n decomposes K6n+4.
Ars Comb., 2018

2015
Every 3-colorable graph has a faithful representation in the odd-distance graph.
Discret. Math., 2015

2014
Forbidden Subgraphs of the Odd-Distance Graph.
J. Graph Theory, 2014

2013
Cubic factorizations.
Discret. Math., 2013

In Praise of the Gram Matrix.
Proceedings of the Mathematics of Paul Erdős I, 2013

2009
Disjoint Hamilton cycles in the star graph.
Inf. Process. Lett., 2009

Spanning cubic graph designs.
Discret. Math., 2009

The Odd-Distance Plane Graph.
Discret. Comput. Geom., 2009

2008
Some of my favorite "lesser known" problems.
Ars Math. Contemp., 2008

2007
Hamilton cycles in prisms.
J. Graph Theory, 2007

A "simple" rectangular puzzle.
Electron. Notes Discret. Math., 2007

2005
The Prism Over the Middle-levels Graph is Hamiltonian.
Order, 2005

2004
Hamiltonian decompositions of prisms over cubic graphs.
Discret. Math., 2004

2002
Antidirected hamiltonian paths between specified vertices of a tournament.
Discret. Appl. Math., 2002

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

2000
Ubiquitous Angles in Equiangular Sets of Lines.
Discret. Comput. Geom., 2000

1997
Graceful matchings in finite fields, the factor-difference sets of integers, and integers of the form <i>a<sup>2</sup> + kb<sup>2</sup></i>.
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.
Proceedings of the Combinatorics and Computer Science, 1995

1990
The number of cycles in 2-factors of cubic graphs.
Discret. Math., 1990

Almost Orthogonal Lines in Ed.
Proceedings of the Applied Geometry And Discrete Mathematics, 1990

1989
On spanning subgraphs of 4-connected planar graphs.
Discret. Appl. Math., 1989

1986
On Hamilton decompositions of prisms over simple 3-polytopes.
Graphs Comb., 1986

1983
The Complexity of Finding Generalized Paths in Tournaments.
J. Algorithms, 1983

1981
A result on Hamiltonian cycles in generalized Petersen graphs.
J. Comb. Theory B, 1981

Realization of certain generalized paths in tournaments.
Discret. Math., 1981

1977
On embedding triangle-free graphs in unit spheres.
Discret. Math., 1977

1973
Hamiltonian circuits in certain prisms.
Discret. Math., 1973


  Loading...