Edge-Colourings of Cubic Graphs and Universal Steiner Triple Systems
From MaRDI portal
Publication:3439623
DOI10.1016/J.ENDM.2007.01.066zbMATH Open1293.05119OpenAlexW1997779839MaRDI QIDQ3439623FDOQ3439623
Authors: Dávid Pál, Martin Škoviera 
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
Recommendations
- Colouring cubic graphs by small Steiner triple systems
- A Steiner triple system which colors all cubic graphs
- Coloring cubic graphs by point-intransitive Steiner triple systems
- Colouring of cubic graphs by Steiner triple systems
- Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems
Cites Work
- The NP-Completeness of Edge-Coloring
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fano colourings of cubic graphs and the Fulkerson conjecture
- Colouring of cubic graphs by Steiner triple systems
- A generalization of Tait coloring cubic graphs
- A Steiner triple system which colors all cubic graphs
Cited In (9)
- Colouring of cubic graphs by Steiner triple systems
- Partial triple systems and edge colourings
- Three-edge-colouring doublecross cubic graphs
- Coloring cubic graphs by point-intransitive Steiner triple systems
- A Steiner triple system which colors all cubic graphs
- Triangle-free Uniquely 3-Edge Colorable 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
This page was built for publication: Edge-Colourings of Cubic Graphs and Universal Steiner Triple Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439623)
