Rainbows in the Hypercube
暂无分享,去创建一个
Maria Axenovich | Ingo Schiermeyer | Arnfried Kemnitz | Heiko Harborth | Meinhard Möller | I. Schiermeyer | M. Axenovich | H. Harborth | A. Kemnitz | M. Möller
[1] Douglas B. West,et al. Edge-Colorings of Complete Graphs that Avoid Polychromatic Trees , 2002, Electron. Notes Discret. Math..
[2] Kathryn Fraughnaugh,et al. Introduction to graph theory , 1973, Mathematical Gazette.
[3] Maria Axenovich,et al. Anti-Ramsey numbers for small complete bipartite graphs , 2004, Ars Comb..
[4] Fan Chung Graham. Subgraphs of a hypercube containing no small even cycles , 1992, J. Graph Theory.
[5] Maria Axenovich,et al. Bipartite anti-Ramsey numbers of cycles , 2004 .
[6] Juan José Montellano-Ballesteros,et al. An Anti-Ramsey Theorem , 2002, Comb..
[7] Yoshiharu Kohayakawa,et al. On the Anti-Ramsey Property of Ramanujan Graphs , 1995, Random Struct. Algorithms.
[8] Ingo Schiermeyer. Rainbow numbers for matchings and complete graphs , 2004, Discret. Math..
[9] Maria Axenovich,et al. Bipartite anti‐Ramsey numbers of cycles , 2004, J. Graph Theory.