7 search results - page 1 / 2 » Homogeneous factorisations of graph products |
DM
2008
13 years 5 months ago
2008
A homogeneous factorisation of a digraph consists of a partition P = {P1, . . . , Pk} of the arc set A and two vertex-transitive subgroups M G Aut() such that M fixes each Pi set...
DCC
2008
IEEE
14 years 4 months ago
2008
IEEE
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...
EJC
2006
13 years 4 months ago
2006
DM
2007
13 years 4 months ago
2007
SOFSEM
2005
Springer
13 years 10 months ago
2005
Springer
d Abstract) Lubomir Torok Institute of Mathematics and Computer Science Slovak Academy of Sciences Severna 5, 974 01 Banska Bystrica, Slovak Republic 3-dimensional layout of graph...