Mark Ramras

According to our database, Mark Ramras authored at least 17 papers between 1990 and 2015.

Collaborative distances:

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

2015

Edge Decompositions of Hypercubes by Paths and by Cycles.

Michel Mollard, Mark Ramras

Graphs Comb., 2015

Edge decompositions of hypercubes by paths.

David Anick, Mark Ramras

Australas. J Comb., 2015

2014

Congestion-free routing of linear permutations on Fibonacci and Lucas cubes.

Mark Ramras

Australas. J Comb., 2014

2011

The Automorphism Group of a Johnson Graph.

Mark Ramras, Elizabeth Donovan

SIAM J. Discret. Math., 2011

2010

Balanced independent sets in hypercubes.

Mark Ramras

Australas. J Comb., 2010

2005

Bipartite Dominating Sets in Hypercubes.

Mark Ramras

Ars Comb., 2005

2004

Minimum cutsets in hypercubes.

Mark Ramras

Discret. Math., 2004

2003

Semi-regular Bipartite Graphs and an Extension of the Marriage Lemma.

Mark Ramras

Ars Comb., 2003

2002

A set intersection theorem and an application to a bipartite Ramsey theorem.

Mark Ramras

Discret. Math., 2002

1999

Regular Subgraphs of Hypercubes.

Mark Ramras

Ars Comb., 1999

1998

Congestion-free Routings of Linear Complement Permutations.

Mark Ramras

SIAM J. Discret. Math., 1998

1997

Congestion-free Optimal Routings of Hypercube Automorphisms.

Mark Ramras

SIAM J. Discret. Math., 1997

Fundamental Subsets of Edges of Hypercubes.

Mark Ramras

Ars Comb., 1997

1993

Routing permutations on a graph.

Mark Ramras

Networks, 1993

1992

Symmetric vertex partitions of hypercubes by isometric trees.

Mark Ramras

J. Comb. Theory, Ser. B, 1992

1991

Symmetric edge-decompositions of hypercubes.

Mark Ramras

Graphs Comb., 1991

1990

A new method of generating Hamiltonian cycles on the n-cube.

Mark Ramras

Discret. Math., 1990