Edge-switching homomorphisms of edge-coloured graphs

@article{Brewster2009EdgeswitchingHO,
  title={Edge-switching homomorphisms of edge-coloured graphs},
  author={Richard C. Brewster and Timothy Graves},
  journal={Discrete Mathematics},
  year={2009},
  volume={309},
  pages={5540-5546}
}
An edge-coloured graph G is a vertex set V(G) together with m edge sets distinguished by m colours. Let π be a permutation on {1, 2, . . . ,m}. We define a switching operation consisting of π acting on the edge colours similar to Seidel switching, to switching classes as studied by Babai and Cameron, and to the pushing operation studied by Klostermeyer and MacGillivray. An edge-coloured graph G is π-permutably homomorphic (respectively π-permutably isomorphic) to an edge-coloured graph H if… CONTINUE READING