We say that an (edge or vertex) colouring is less symmetric than an (edge or vertex) colouring, if every automorphism of that preserves also preserves.

We show that if G is not a bicentred tree, then for every vertex colouring of G there is a less symmetric edge colouring with the same number of colours. On the ...

Jul 3, 2018 · We show that if G is not a bicentred tree, then for every vertex colouring of G there is a less symmetric edge colouring with the same number of ...

Apr 15, 2020 · We say that c0 is less symmetric than c if the stabiliser of c0 is contained in the stabiliser of c.

Jul 3, 2018 · Abstract. Let c and c′ be edge or vertex colourings of a graph G. We say that c′ is less symmetric than c if the stabiliser (in Aut G) of c′ ...

We show that if G is not a bicentred tree, then for every vertex colouring of G there is a less symmetric edge colouring with the same number of colours. On the ...

On symmetries of edge and vertex colourings of graphs · Florian Lehner, Simon M. Smith · Published in Discrete Mathematics 3 July 2018 · Mathematics.

We show that if G is not a bicentred tree, then for every vertex colouring of G there is a less symmetric edge colouring with the same number of colours. On the ...

On symmetries of edge and vertex colourings of graphs. Florian Lehner*, Simon M. Smith. *Corresponding author for this work. Institute of Discrete Mathematics ...

The symmetry restrictions are represented by colouring of edges and vertices of the dependence graph of the model. In the present article we introduce the model ...