73 search results - page 12 / 15 » jct 2007 |
JCT
2007
13 years 8 months ago
2007
In numerous positional games the identity of the winner is easily determined. In this case one of the more interesting questions is not who wins but rather how fast can one win. T...
JCT
2007
13 years 8 months ago
2007
We show that to each graceful labelling of a path on 2s + 1 vertices, s ≥ 2, there corresponds a current assignment on a 3-valent graph which generates at least 22s cyclic orien...
JCT
2007
13 years 8 months ago
2007
We give the first known examples of 6-sparse Steiner triple systems by constructing 29 such systems in the residue class 7 modulo 12, with orders ranging from 139 to 4447. We the...
JCT
2007
13 years 8 months ago
2007
A brick is a 3-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. The importance of bricks stems from the fact that...
JCT
2007
13 years 8 months ago
2007
Abstract. Simple families of increasing trees can be constructed from simply generated tree families, if one considers for every tree of size n all its increasing labellings, i.e.,...