Colouring of cubic graphs by Steiner triple systems

DOI10.1016/J.JCTB.2003.10.003MaRDI QIDQ1826953zbMATHOpenAlexFDO

Authors Fred C. Holroyd, Martin Škoviera

Publication date 6 August 2004

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL http://oro.open.ac.uk/3491/1/Steiner5.pdf

zbMATH Keywords

colouringSteiner triple systembridgeless cubic graph

Mathematics Subject Classification ID

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

Recommendations

• A Steiner triple system which colors all cubic graphs
• Colouring cubic graphs by small Steiner triple systems
• Characterisation results for Steiner triple systems and their application to edge-colourings of cubic graphs
• Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems
• Edge-Colourings of Cubic Graphs and Universal Steiner Triple Systems

Cites work

• scientific article; zbMATH DE number 4075098 (Why is no real title available?)
• scientific article; zbMATH DE number 1432797 (Why is no real title available?)
• A generalization of Tait coloring cubic graphs
• A small basis for four‐line configurations in steiner triple systems. Dedicated to the memory of gemma holly griggs
• Some results on quadrilaterals in Steiner triple systems

Cited in

(19)

• On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems
• Characterisation results for Steiner triple systems and their application to edge-colourings of cubic graphs
• Fano colourings of cubic graphs and the Fulkerson conjecture
• Cubic graphs that cannot be covered with four perfect matchings
• Wilson-Schreiber colourings of cubic graphs
• Perfect matchings with restricted intersection in cubic graphs
• Colouring cubic graphs by small Steiner triple systems
• Abelian Colourings of Cubic Graphs
• Edge-Colourings of Cubic Graphs and Universal Steiner Triple Systems
• \(H\)-colorings for 4-regular graphs
• Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems
• Normal 6-edge-colorings of some bridgeless cubic graphs
• Projective, affine, and abelian colorings of cubic graphs
• Characterization of affine Steiner triple systems and Hall triple systems
• Coloring cubic graphs by point-intransitive Steiner triple systems
• Strict colouring for classes of Steiner triple systems
• Bicolour graphs of Steiner triple systems
• Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching
• A Steiner triple system which colors all cubic graphs

This page was built for publication: Colouring of cubic graphs by Steiner triple systems

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