Distinguishing regular graphs
From MaRDI portal
Publication:6406470
arXiv2207.14728MaRDI QIDQ6406470FDOQ6406470
Authors: Jakub Kwaśny, Marcin Stawiski 
Publication date: 29 July 2022
Abstract: Call an edge colouring of a graph distinguishing if the only automorphism that preserves that colouring is the identity. We prove that every locally finite connected regular graph of order at least 7 admits a distinguishing edge colouring with two colours.
Coloring of graphs and hypergraphs (05C15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Infinite graphs (05C63)
This page was built for publication: Distinguishing regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6406470)
