Wilson-Schreiber Colourings of Cubic Graphs

DOI10.1016/j.endm.2009.07.037zbMath1273.05068OpenAlexW1983953259MaRDI QIDQ2851467

Martin Škoviera, Edita Máčajová, Michael John Grannell, Terry S. Griggs

Publication date: 10 October 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2009.07.037

zbMATH Keywords

Steiner triple systemcubic graphedge-colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Resolvent positive linear operators exhibit the reduction phenomenon ⋮ Coloring Cubic Graphs by Point-Intransitive Steiner Triple Systems

Cites Work

• Unnamed Item
• Unnamed Item
• Fano colourings of cubic graphs and the Fulkerson conjecture
• Colouring cubic graphs by small Steiner triple systems
• Colouring of cubic graphs by Steiner triple systems
• Covering all triples on n marks by disjoint Steiner systems
• Projective, affine, and abelian colorings of cubic graphs
• Coloring Cubic Graphs by Point-Intransitive Steiner Triple Systems
• Characterisation Results for Steiner Triple Systems and Their Application to Edge-Colourings of Cubic Graphs
• A Steiner triple system which colors all cubic graphs

This page was built for publication: Wilson-Schreiber Colourings of Cubic Graphs