Author:
Gordon Gary,McNulty Jennifer,Neudauer Nancy Ann
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference11 articles.
1. Albertson, M.O., Collins, K.L.: Symmetry breaking in graphs. Electron J. Comb. 3(1), R18 (1996). (Research Paper 18, approx. 17 pp. (electronic))
2. Bailey, R.F., Cameron, P.J.: Base size, metric dimension and other invariants of groups and graphs. Bull. Lond. Math. Soc. 43(2), 209–242 (2011)
3. Boutin, D.L.: Identifying graph automorphisms using determining sets. Electron J. Comb. 13(1), R78 (2006). (Research Paper 78 (electronic))
4. Brualdi, R.A.: Transversal matroids. In: Combinatorial Geometries, vol. 29 of Encyclopedia Math. Appl., pp. 72–97. Cambridge University Press, Cambridge (1987)
5. Cáceres, J., Garijo, D., González, A., Márquez, A., Puertas, M.L.: The determining number of Kneser graphs. Discret. Math. Theor. Comput. Sci. 15(1), 1–14 (2013)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献