Judith Kloas

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2018

Distinguishing locally finite trees

Svenja Hüning, Wilfried Imrich, Judith Kloas +2

The distinguishing number $D (G)$ of a graph $G$ is the smallest number of colors that is needed to color the vertices of $G$ such that the only color preserving automorphism is the…

math.CO2017

Distinguishing graphs of maximum valence 3

Svenja Hüning, Wilfried Imrich, Judith Kloas +2

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 gi…