Distinguishing regular graphs

MaRDI QIDQ6406470zbMATH OpenFDO

Authors Jakub Kwaśny, Marcin Stawiski

Publication date 29 July 2022

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Infinite graphs (05C63)

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.

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)