Grannell, M. J.; Griggs, T. S. and Rosa, A.
|Google Scholar:||Look up in Google Scholar|
There are five possible structures for a set of three lines of a Steiner triple system. Each of these three-line ``configurations'' gives rise to a colouring problem in which a partition of all the lines of an STS() is sought, the components of the partition each having the property of not containing any copy of the configuration in question. For a three-line configuration , and STS() , the minimum number of classes required is denoted by and is called the -chromatic index of . This generalises the ordinary chromatic index and the 2-parallel chromatic index . (For the latter see .) In this paper we obtain results concerning for four of the five three-line configurations . In three of the cases we give precise values for all sufficiently large and in the fourth case we give an asymptotic result. The values of the four chromatic indices for are also determined.
|Item Type:||Journal Article|
|Academic Unit/Department:||Mathematics, Computing and Technology > Mathematics and Statistics|
|Depositing User:||Mike Grannell|
|Date Deposited:||18 Aug 2010 13:44|
|Last Modified:||02 Dec 2010 21:02|
Actions (login may be required)
|Report issue / request change|