Grannell, Mike; Griggs, Terry; Knor, Martin and Skoviera, Martin
(2004).
| DOI (Digital Object Identifier) Link: | https://doi.org/10.1002/jgt.10166 |
|---|---|
| Google Scholar: | Look up in Google Scholar |
Abstract
We prove that there is a Steiner triple system such that every simple cubic graph can have its edges colored by points of in such a way that for each vertex the colors of the three incident edges form a triple in . This result complements the result of Holroyd and koviera that every bridgeless cubic graph admits a similar coloring by any Steiner triple system of order greater than 3. The Steiner triple system employed in our proof has order 381 and is probably not the smallest possible.
| Item Type: | Article |
|---|---|
| ISSN: | 0364-9024 |
| Keywords: | cubic graphs; coloring; Steiner triple system |
| Academic Unit/School: | Faculty of Science, Technology, Engineering and Mathematics (STEM) > Mathematics and Statistics Faculty of Science, Technology, Engineering and Mathematics (STEM) |
| Item ID: | 2148 |
| Depositing User: | Mike Grannell |
| Date Deposited: | 06 Jun 2006 |
| Last Modified: | 04 Oct 2016 09:46 |
| URI: | http://oro.open.ac.uk/id/eprint/2148 |
| Share this page: |     |
Altmetrics | Scopus Citations |