References
- AlbertsonM.O., CollinsK.L., Symmetry breaking in graphs, Electron. J. Combin., 3 1996 #R18
- KalinowskiR., PilśniakM., Distinguishing graphs by edge colourings, European J. Combin., 45 2015 124–131
- AcharyaB.D., SampathkumarE., Graphoidal covers and graphoidal covering number of a graph, Indian J. Pure Appl. Math., 18101987 882–890
- ArumugamS., PakkiamC., Graphoidal bipartite graphs, Graphs Combin., 10 1994 305–310
- BeinekeL.W., Characterizations of derived graphs, J. Combin. Theory, 921970 129–135
- SabidussiG., Graph derivatives, Math. Z., 76 1961 385–401
- PilśniakM., Improving upper bounds for the distinguishing index, Ars Math. Contemp., 13 2017 259–274
- CollinsK.L., TrenkA.N., The distinguishing chromatic number, Electron. J. Combin., 13 2006 #R16
- S. Alikhani, S. Klav̌zar, F. Lehner, S. Soltani, Trees with distinguishing index equal distinguishing number plus one,arXiv:1608.03501v4 [math.CO].