Sciweavers

91
Voted
DCC
2008
IEEE
16 years 21 days ago
Homogeneous factorisations of Johnson graphs
For a graph , subgroups M < G Aut(), and an edge partition E of , the pair (, E) is a (G, M)-homogeneous factorisation if M is vertex-transitive on and fixes setwise each part...
Maria Cristeta Cuaresma, Michael Giudici, Cheryl E...