Distinguishing graphs of maximum valence 3

Svenja Hüning, Hannah Schreiber, Wilfried Imrich, Judith Kloas, Thomas Tucker

Research output: Contribution to journalArticle


The distinguishing number D(G) of a graph G is the smallest number of colors that is needed to color G such that the only color preserving automorphism is the identity. We give a complete classification for all connected graphs G of maximum valence Δ(G)=3 and distinguishing number D(G)=3. As one of the consequences we get that all infinite connected graphs with Δ(G)=3 are 2-distinguishable.
Original languageEnglish
Article numberP.4.36
Number of pages27
JournalElectronic Journal of Combinatorics
Issue number4
Publication statusPublished - 22 Nov 2019

Fingerprint Dive into the research topics of 'Distinguishing graphs of maximum valence 3'. Together they form a unique fingerprint.

Cite this