References
- Albertson, M. O., Collins, K. L. (1996). Symmetry breaking in graphs. Electron. J. Comb. 3(1): Research Paper 18, approx. 17 pp.
- Alikhani, S., Soltani, S. (2017). The distinguishing number of Kronecker product of two graphs. In: Theoretical Computer Science and Discrete Mathematics. Lecture Notes in Computer Science, Vol. 10398. Cham: Springer, pp. 341–346.
- Che, Z., Collins, K. L. (2013). The distinguishing chromatic number of Kneser graphs. Electron. J. Comb. 20(1): Paper 23, 12 pp.
- Cheng, C. T. (2006). On computing the distinguishing numbers of trees and forests. Electron. J. Comb. 13(1): Research Paper 11, 12 pp.
- Collins, K. L., Trenk, A. N. (2006). The distinguishing chromatic number. Electron. J. Comb. 13(1): Research Paper 16, 19 pp.
- Cormen, T. H., Leiserson, C. E., Rivest, R. L., Stein, C. (2009). Introduction to Algorithm, 3rd ed. Cambridge, MA: MIT Press.
- Cranston, D. W. (2018). Proper distinguishing colorings with few colors for graphs with girth at least 5. Electron. J. Comb. 25(3): Paper 3.5, 9 pp.
- Hammack, R. H., Imrich, W., Klav̌zar, S. (2011). Handbook of Product of Graphs. Boca Raton: CRC Press.
- Imrich, W., Klav̌zar, S. (2006). Distinguishing cartesian powers of graphs. J. Graph Theory 53(3): 250–260.
- Imrich, W., Jerebic, J., Klav̌zar, S. (2008). The distinguishing number of Cartesian products of complete graphs. Eur. J. Comb. 29(4): 922–929.
- Jha, P. K., Klav̌zar, S., Zmazek, B. (1997). Isomorphic components of Kronecker product of bipartite graphs. Discuss. Math. Graph Theory 17(2): 301–309.
- Čulik, K. (1958). Zur theorie der graphen. Časopis Pešt. Mat. 83: 135–155.
- Weichsel, P. M. (1962). The Kronecker product of graphs. Proc. Am. Math. Soc. 13: 47–52.