Colouring of cubic graphs by Steiner triple systems

DOI10.1016/j.jctb.2003.10.003zbMath1042.05043OpenAlexW2150339468MaRDI QIDQ1826953

Martin Škoviera, F. C. Holroyd

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)

Related Items

Colouring cubic graphs by small Steiner triple systems ⋮ Characterization of affine Steiner triple systems and Hall triple systems ⋮ Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems ⋮ \(H\)-colorings for 4-regular graphs ⋮ Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching ⋮ Perfect matchings with restricted intersection in cubic graphs ⋮ Cubic graphs that cannot be covered with four perfect matchings ⋮ Projective, affine, and abelian colorings of cubic graphs ⋮ Normal 6-edge-colorings of some bridgeless cubic graphs ⋮ Wilson-Schreiber Colourings of Cubic Graphs ⋮ Coloring Cubic Graphs by Point-Intransitive Steiner Triple Systems ⋮ Abelian Colourings of Cubic Graphs ⋮ Edge-Colourings of Cubic Graphs and Universal Steiner Triple Systems ⋮ Fano colourings of cubic graphs and the Fulkerson conjecture

Cites Work

• Some results on quadrilaterals in Steiner triple systems
• A small basis for four‐line configurations in steiner triple systems. Dedicated to the memory of gemma holly griggs
• Unnamed Item
• Unnamed Item
• Unnamed Item