deBruijn-like sequences and the irregular chromatic number of paths and cycles
暂无分享,去创建一个
Ellen Gethner | Michael Ferrara | Christine Lee | Phil Wallis | Ellen Gethner | M. Ferrara | Christine Lee | Phil Wallis
[1] Ping Zhang,et al. On the irregular chromatic number of a graph , 2006 .
[3] P. Seymour,et al. A new proof of the four-colour theorem , 1996 .
[4] Gary Chartrand,et al. Detectable colorings of graphs , 2006 .
[5] W. Imrich,et al. Distinguishing Cartesian powers of graphs , 2006 .
[6] de Ng Dick Bruijn. A combinatorial problem , 1946 .
[7] Mary Lynn Radcliffe,et al. On the Irregular Colorings of Graphs , 2005 .
[8] Karen L. Collins,et al. The Distinguishing Chromatic Number , 2006, Electron. J. Comb..
[9] K. Appel,et al. Every Planar Map Is Four Colorable , 2019, Mathematical Solitaires & Games.
[10] Mehdi Behzad,et al. Graphs and Digraphs , 1981, The Mathematical Gazette.
[11] Michael O. Albertson,et al. Symmetry Breaking in Graphs , 1996, Electron. J. Comb..
[12] Debra L. Boutin,et al. Distinguishing geometric graphs , 2006 .
[13] Richard H. Schelp,et al. Vertex-distinguishing proper edge-colorings , 1997, Journal of Graph Theory.
[14] P. N. Balister,et al. Vertex distinguishing colorings of graphs with Delta(G)=2 , 2002, Discret. Math..
[15] Keith R Fox,et al. A fast algorithm for the construction of universal footprinting templates in DNA , 2006, Journal of mathematical biology.
[16] G. Chartrand. Graphs and Digraphs, Fourth Edition , 2004 .