Edge-Colourings of Cubic Graphs and Universal Steiner Triple Systems

DOI10.1016/j.endm.2007.01.066zbMath1293.05119OpenAlexW1997779839MaRDI QIDQ3439623

Martin Škoviera, Dávid Pál

Publication date: 29 May 2007

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

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

zbMATH Keywords

Steiner triple systemcubic graphedge-colouring

Mathematics Subject Classification ID

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

Cites Work

• Fano colourings of cubic graphs and the Fulkerson conjecture
• Colouring of cubic graphs by Steiner triple systems
• The NP-Completeness of Edge-Coloring
• A Steiner triple system which colors all cubic graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Edge-Colourings of Cubic Graphs and Universal Steiner Triple Systems