|
Search the dblp DataBase
Moshe Rosenfeld:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- 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. [Citation Graph (0, 0)][DBLP] Combinatorics and Computer Science, 1995, pp:67-73 [Conf]
- Pavol Hell, Moshe Rosenfeld
Antidirected hamiltonian paths between specified vertices of a tournament. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2002, v:117, n:1-3, pp:87-98 [Journal]
- Roman Cada, Tomás Kaiser, Moshe Rosenfeld, Zdenek Ryjácek
Hamiltonian decompositions of prisms over cubic graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2004, v:286, n:1-2, pp:45-56 [Journal]
- Jaroslav Nesetril, Moshe Rosenfeld
I. Schur, C.E. Shannon and Ramsey Numbers, a short story. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2001, v:229, n:1-3, pp:185-195 [Journal]
- Pavol Hell, Moshe Rosenfeld
The Complexity of Finding Generalized Paths in Tournaments. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1983, v:4, n:4, pp:303-309 [Journal]
- Peter Horák, Tomás Kaiser, Moshe Rosenfeld, Zdenek Ryjácek
The Prism Over the Middle-levels Graph is Hamiltonian. [Citation Graph (0, 0)][DBLP] Order, 2005, v:22, n:1, pp:73-81 [Journal]
- Brian Alspach, Moshe Rosenfeld
Realization of certain generalized paths in tournaments. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1981, v:34, n:2, pp:199-202 [Journal]
- Moshe Rosenfeld
The number of cycles in 2-factors of cubic graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1990, v:84, n:3, pp:285-294 [Journal]
On spanning subgraphs of 4-connected planar graphs. [Citation Graph (, )][DBLP]
The Odd-Distance Plane Graph. [Citation Graph (, )][DBLP]
Spanning cubic graph designs. [Citation Graph (, )][DBLP]
Search in 0.033secs, Finished in 0.034secs
|