default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMoshe Rosenfeld 0001
Person information
- affiliation: University of Washington, Tacoma, WA, USA
- affiliation (former): Pacific Lutheran University, Tacoma, WA, USA
Other persons with the same name
- Moshe Rosenfeld 0002
![[0000-0002-3008-8053]](https://dblp.org/img/orcid-mark.12x12.png "0000-0002-3008-8053")
— Tel Aviv University, Israel
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j23]Vu Dinh Hoa, Moshe Rosenfeld:
A new labeling of C2n proves that K4 + M6n decomposes K6n+4. Ars Comb. 139: 255-267 (2018)- 2015
- [j22]Tien-Nam Le, Fiachra Knox, Moshe Rosenfeld:
Every 3-colorable graph has a faithful representation in the odd-distance graph. Discret. Math. 338(9): 1614-1620 (2015) - 2014
- [j21]Moshe Rosenfeld, Nam Lê Tien:
Forbidden Subgraphs of the Odd-Distance Graph. J. Graph Theory 75(4): 323-330 (2014) - 2013
- [j20]Moshe Rosenfeld, Vu Dinh Hoa:
Cubic factorizations. Discret. Math. 313(19): 1952-1960 (2013) - [p1]Moshe Rosenfeld:
In Praise of the Gram Matrix. The Mathematics of Paul Erdős I 2013: 551-557
2000 – 2009
- 2009
- [j19]Hayri Ardal, Ján Manuch, Moshe Rosenfeld, Saharon Shelah, Ladislav Stacho:
The Odd-Distance Plane Graph. Discret. Comput. Geom. 42(2): 132-141 (2009) - [j18]Peter Adams, Hayri Ardal, Ján Manuch, Vu Dinh Hoa, Moshe Rosenfeld, Ladislav Stacho:
Spanning cubic graph designs. Discret. Math. 309(18): 5781-5788 (2009) - [j17]Roman Cada, Tomás Kaiser, Moshe Rosenfeld, Zdenek Ryjácek:
Disjoint Hamilton cycles in the star graph. Inf. Process. Lett. 110(1): 30-35 (2009) - 2008
- [j16]Moshe Rosenfeld:
Some of my favorite "lesser known" problems. Ars Math. Contemp. 1(2): 137-143 (2008) - 2007
- [j15]Moshe Rosenfeld:
A "simple" rectangular puzzle. Electron. Notes Discret. Math. 28: 409-415 (2007) - [j14]Tomás Kaiser, Zdenek Ryjácek, Daniel Král, Moshe Rosenfeld, Heinz-Jürgen Voss:
Hamilton cycles in prisms. J. Graph Theory 56(4): 249-269 (2007) - 2005
- [j13]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
- [j12]Roman Cada, Tomás Kaiser, Moshe Rosenfeld, Zdenek Ryjácek:
Hamiltonian decompositions of prisms over cubic graphs. Discret. Math. 286(1-2): 45-56 (2004) - 2002
- [j11]Pavol Hell, Moshe Rosenfeld:
Antidirected hamiltonian paths between specified vertices of a tournament. Discret. Appl. Math. 117(1-3): 87-98 (2002) - 2001
- [j10]Jaroslav Nesetril, Moshe Rosenfeld:
I. Schur, C.E. Shannon and Ramsey Numbers, a short story. Discret. Math. 229(1-3): 185-195 (2001) - 2000
- [j9]Barry Guiduli, Moshe Rosenfeld:
Ubiquitous Angles in Equiangular Sets of Lines. Discret. Comput. Geom. 24(2-3): 313-324 (2000)
1990 – 1999
- 1997
- [c3]Moshe Rosenfeld:
Graceful matchings in finite fields, the factor-difference sets of integers, and integers of the form a2 + kb2. Contemporary Trends in Discrete Mathematics 1997: 275-281 - 1995
- [c2]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
- [j8]Moshe Rosenfeld:
The number of cycles in 2-factors of cubic graphs. Discret. Math. 84(3): 285-294 (1990) - [c1]Moshe Rosenfeld:
Almost Orthogonal Lines in Ed. Applied Geometry And Discrete Mathematics 1990: 489-492
1980 – 1989
- 1989
- [j7]Moshe Rosenfeld:
On spanning subgraphs of 4-connected planar graphs. Discret. Appl. Math. 25(3): 279-287 (1989) - 1986
- [j6]Brian Alspach, Moshe Rosenfeld:
On Hamilton decompositions of prisms over simple 3-polytopes. Graphs Comb. 2(1): 1-8 (1986) - 1983
- [j5]Pavol Hell, Moshe Rosenfeld:
The Complexity of Finding Generalized Paths in Tournaments. J. Algorithms 4(4): 303-309 (1983) - 1981
- [j4]Brian Alspach, Moshe Rosenfeld:
Realization of certain generalized paths in tournaments. Discret. Math. 34(2): 199-202 (1981) - [j3]Brian Alspach, Peter J. Robinson, Moshe Rosenfeld:
A result on Hamiltonian cycles in generalized Petersen graphs. J. Comb. Theory B 31(2): 225-231 (1981)
1970 – 1979
- 1977
- [j2]Brian Alspach, Moshe Rosenfeld:
On embedding triangle-free graphs in unit spheres. Discret. Math. 19(2): 103-111 (1977) - 1973
- [j1]Moshe Rosenfeld, David W. Barnette:
Hamiltonian circuits in certain prisms. Discret. Math. 5(4): 389-394 (1973)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:58 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
