| 2005 |
|---|
| 10 | | Mark Ramras:
Bipartite Dominating Sets in Hypercubes.
Ars Comb. 77: (2005) |
| 2004 |
|---|
| 9 | EE | Mark Ramras:
Minimum cutsets in hypercubes.
Discrete Mathematics 289(1-3): 193-198 (2004) |
| 2003 |
|---|
| 8 | | Mark Ramras:
Semi-regular Bipartite Graphs and an Extension of the Marriage Lemma.
Ars Comb. 66: (2003) |
| 2002 |
|---|
| 7 | EE | Mark Ramras:
A set intersection theorem and an application to a bipartite Ramsey theorem.
Discrete Mathematics 242(1-3): 297-298 (2002) |
| 1999 |
|---|
| 6 | | Mark Ramras:
Regular Subgraphs of Hypercubes.
Ars Comb. 52: (1999) |
| 1998 |
|---|
| 5 | EE | Mark Ramras:
Congestion-free Routings of Linear Complement Permutations.
SIAM J. Discrete Math. 11(3): 487-500 (1998) |
| 1997 |
|---|
| 4 | | Mark Ramras:
Fundamental Subsets of Edges of Hypercubes.
Ars Comb. 46: (1997) |
| 3 | EE | Mark Ramras:
Congestion-free Optimal Routings of Hypercube Automorphisms.
SIAM J. Discrete Math. 10(2): 201-208 (1997) |
| 1992 |
|---|
| 2 | EE | Mark Ramras:
Symmetric vertex partitions of hypercubes by isometric trees.
J. Comb. Theory, Ser. B 54(2): 239-248 (1992) |
| 1990 |
|---|
| 1 | EE | Mark Ramras:
A new method of generating Hamiltonian cycles on the n-cube.
Discrete Mathematics 85(3): 329-331 (1990) |
