[1]
Cranston, D.W. 2018. Proper Distinguishing Colorings with Few Colors for Graphs with Girth at Least 5. The Electronic Journal of Combinatorics. 25, 3 (Jul. 2018), #P3.5. DOI:https://doi.org/10.37236/7170.