Solution of an outstanding conjecture: the non-existence of universal cycles with k=n−2 ... conjectured that universal cycles never exist when k=n−2. We ...

Solution of an outstanding conjecture: the non-existence of universal cycles ... Conjecture 2. For every k¿2 there is an n0(k) such that for each n ...

Solution of an outstanding conjecture: the non-existence of universal cycles with k = n- 2. Discrete Mathematics, 258(1-3), pp. 193-204. LINKS. Table of n, a ...

Solution of an outstanding conjecture: the non-existence of universal cycles with k=n-2. Discret. Math. 258(1-3): 193-204 (2002). [+][–]. 1990 – 1999. FAQ. see ...

Co-authors ; Solution of an outstanding conjecture: the non-existence of universal cycles with k= n− 2. B Stevens, P Buskell, P Ecimovic, C Ivanescu, AM Malik, A ...

Solution of an outstanding conjecture: The non-existence of universal cycles with k = n - 2. Article. Full-text available. Dec 2002; DISCRETE MATH. Brett ...

A Linear Time Algorithm for Computing Longest Paths in 2-Trees. ... Solution of an outstanding conjecture: the non-existence of universal cycles with k=n-2.

Solution of an outstanding conjecture: the non- existence of universal cycles with k=n−2 k = n − 2 . Discrete Mathematics, 258(1):193–204, 2002 ...

Solution of an Outstanding Conjecture: the Non-existence of Universal Cycles with $k=n-2$, (with 9 others), Discrete Mathematics, 258(1-3), pp. 193-204 ...

Solution of an outstanding conjecture: the non-existence of universal cycles with k=n−2 · Anamaria Savu. Discrete Mathematics, 2002. downloadDownload free PDF