Holroyd, Fred and Skoviera, Martin
PDF (Not Set)
- Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
|DOI (Digital Object Identifier) Link:||http://dx.doi.org/10.1016/j.jctb.2003.10.003|
|Google Scholar:||Look up in Google Scholar|
Let S be a Steiner triple system and G a cubic graph. We say that G is S-colourable if its edges can be coloured so that at each vertex the incident colours form a triple of S. We show that if S is a projective system PG(n, 2), n >= 2, then G is S-colourable if and only if it is bridgeless, and that every bridgeless cubic graph has an S-colouring for every Steiner triple system of order greater than 3. We establish a condition on a cubic graph with a bridge which ensures that it fails to have an S-colouring if S is an affine system, and we conjecture that this is the only obstruction to colouring any cubic graph with any non-projective system of order greater than 3.
|Item Type:||Journal Article|
|Extra Information:||Some of the symbols may not have transferred correctly into this bibliographic record and/or abstract.---
The DOI leads direct to the article; the URL leads direct to the journal homepage.
|Keywords:||Graph colourings; cubic graphs; Steiner triple systems|
|Academic Unit/Department:||Mathematics, Computing and Technology > Mathematics and Statistics
Mathematics, Computing and Technology
|Depositing User:||Fred Holroyd|
|Date Deposited:||27 Jun 2006|
|Last Modified:||15 Jan 2016 03:34|
|Share this page:|