Characterisation results for Steiner triple systems and their application to edge-colourings of cubic graphs

DOI10.4153/CJM-2010-021-9zbMATH Open1195.05012WikidataQ57601411 ScholiaQ57601411MaRDI QIDQ3550147FDOQ3550147

Jean-Sébastien Sereni, Daniel Král', E. Máčajová, Attila Pór

Publication date: 31 March 2010

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

configurationsSteiner triple systemedge colourings of graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Triple systems (05B07)

Cited In (10)

• Steiner loops of affine type
• Characterization of affine Steiner triple systems and Hall triple systems
• Colouring of cubic graphs by Steiner triple systems
• Coloring cubic graphs by point-intransitive Steiner triple systems
• A note on characterizations of affine and Hall triple systems
• A Sylvester-Gallai type theorem for abelian groups
• Killing metrized commutative nonassociative algebras associated with Steiner triple systems
• New approach to Petersen coloring
• Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems
• Wilson-Schreiber colourings of cubic graphs

   Recommendations

• Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems 👍 👎
• Colouring of cubic graphs by Steiner triple systems 👍 👎
• A Steiner triple system which colors all cubic graphs 👍 👎
• Edge-Colourings of Cubic Graphs and Universal Steiner Triple Systems 👍 👎
• Colouring cubic graphs by small Steiner triple systems 👍 👎

This page was built for publication: Characterisation results for Steiner triple systems and their application to edge-colourings of cubic graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3550147)