Opening book details…
Can I read Colouring of cubic graphs by Steiner triple systems on EtoBox?
Colouring of cubic graphs by Steiner triple systems by Fred Holroyd; Martin Škoviera is a Computer Science article available to read on EtoBox.
What is Colouring of cubic graphs by Steiner triple systems about?
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Þ; nX2; 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.
Who reads Colouring of cubic graphs by Steiner triple systems?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Fred Holroyd; Martin Škoviera
- Publisher
- Elsevier Science; Elsevier ; Elsevier Inc.; Elsevier BV (ISSN 0095-8956)
- Published
- 2004
- Language
- EN
- Field
- Computer Science (Physical Sciences)