547 search results - page 63 / 110 » dm 2008 |
101
click to vote
DM
2008
15 years 4 months ago
2008
In this paper, we prove that cyclic hamiltonian cycle systems of the complete graph minus a 1-factor, Kn - I, exist if and only if n 2, 4( mod 8) and n = 2p with p
111
click to vote
DM
2008
15 years 4 months ago
2008
It is proved that edges of a graph G with no component K2 can be coloured using at most 2 log2 (G) + 1 colours so that any two adjacent vertices have distinct sets of colours of t...
117
click to vote
DM
2008
15 years 4 months ago
2008
One proves that certain numbers occurring in a problem of paths enumeration, studied by Niederhausen in [7] (see also [10]), are top intersection numbers in the cohomology ring of...
130
click to vote
DM
2008
15 years 4 months ago
2008
We present new constructions for (n, w, ) optical orthogonal codes (OOC) using techniques from finite projective geometry. In one case codewords correspond to (q - 1)-arcs contain...
135
click to vote
DM
2008
15 years 4 months ago
2008
The line index of a graph G is the smallest k such that the kth iterated line graph of G is nonplanar. We show that the line index of a graph is either in nite or it is at most 4....