Paper Info
Title
On symmetries of edge and vertex colourings of graphs
Abstract
Let c and c′ be edge or vertex colourings of a graph G. The stabiliser of c is the set of automorphisms of G that preserve the colouring. We say that c′ is less symmetric than c if the stabiliser of c′ is contained in the stabiliser of c.
Year
DOI
Venue
2020
10.1016/j.disc.2020.111959
Discrete Mathematics
Keywords
DocType
Volume
Graph automorphism,Graph colouring,Distinguishing number,Distinguishing index
Journal
343
Issue
ISSN
Citations 
9
0012-365X
0
PageRank 
References 
Authors
0.34
0
2
Name
Order
Citations
PageRank
Florian Lehner1217.24
Simon M. Smith210.70