Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,General Mathematics
Reference22 articles.
1. M. O. Albertson and K. L. Collins, Symmetry breaking in graphs, Electron. J. Combin., 3 (1996), no. 1, Research Paper 18, approx. 17 pp. https://doi.org/10.37236/1242.
2. S. Alikhani, S. Klavžar, F. Lehner, S. Soltani, Trees with distinguishing index equal distinguishing number plus one, Discussiones Mathematicae Graph Theory, 40 (2020), 875–884.
3. V. Arvind, N. Devanur, Symmetry breaking in trees and planar graphs by vertex coloring, in: Proceedings of the 8th Nordic Combinatorial Conference, Aalborg University, Aalborg, Denmark, 2004.
4. M. S. Cavers, K. Seyffarth and E. P. White, Distinguishing chromatic numbers of complements of Cartesian products of complete graphs, Discrete Math., 341 (9) (2018), 2431–2441.
5. D. W. Cranston, Proper distinguishing colorings with few colors for graphs with girth at least 5. Electron. J. Combin., 25 (2018), Paper No. 3.5, 9 pp.