Name
Title | Citations | PageRank | Year |
|---|---|---|---|
| Almost Partitioning a 3-Edge-Colored Kn, n into Five Monochromatic Cycles. | 0 | 0.34 | 2017 |
| Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles | 0 | 0.34 | 2015 |
| The Ninth World Microcomputer Chess Championship. | 0 | 0.34 | 1989 |