3 citations · 5 across the 9 of their papers we have counts for
1 paper · 1 filter
Florian Lehner
A graph G is said to be 2-distinguishable if there is a 2-labeling of its vertices which is not preserved by any nontrivial automorphism of G. We show that every locally finite gra…