List distinguishing parameters of trees
暂无分享,去创建一个
[1] Xuding Zhu,et al. Cartesian powers of graphs can be distinguished by two labels , 2007, Eur. J. Comb..
[2] C. Jordan. Sur les assemblages de lignes. , 1869 .
[3] Garth Isaak,et al. Distinguishing colorings of Cartesian products of complete graphs , 2008, Discret. Math..
[4] Nikhil R. Devanur,et al. On Computing the Distinguishing Numbers of Planar Graphs and Beyond: A Counting Approach , 2007, SIAM J. Discret. Math..
[5] S. Klavžar,et al. Distinguishing labellings of group action on vector spaces and graphs , 2006 .
[6] Bikash Bhattacharjya,et al. Breaking the Symmetries of the Book Graph and the Generalized Petersen Graph , 2009, SIAM J. Discret. Math..
[7] Karen L. Collins,et al. The Distinguishing Chromatic Number , 2006, Electron. J. Comb..
[8] Claude Laflamme,et al. Distinguishing Chromatic Numbers of Bipartite Graphs , 2009, Electron. J. Comb..
[9] Sandi Klavzar,et al. The distinguishing chromatic number of Cartesian products of two complete graphs , 2010, Discret. Math..
[10] Christine T. Cheng. On Computing the Distinguishing Numbers of Trees and Forests , 2006, Electron. J. Comb..
[11] Michael O. Albertson,et al. Symmetry Breaking in Graphs , 1996, Electron. J. Comb..
[12] Stephen G. Hartke,et al. Distinguishing Chromatic Number of Cartesian Products of Graphs , 2010, SIAM J. Discret. Math..
[13] Ellen Gethner,et al. List-Distinguishing Colorings of Graphs , 2011, Electron. J. Comb..
[14] Debra L. Boutin. The determining number of a Cartesian product , 2009, J. Graph Theory.
[15] Christine T. Cheng. On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results , 2009, Discret. Math..
[16] Lenore Cowen,et al. The distinguishing number of the hypercube , 2004, Discret. Math..