scientific article; zbMATH DE number 2061154
From MaRDI portal
Publication:4457006
Cited in
(8)- On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems
- Steiner systems and configurations of points
- scientific article; zbMATH DE number 1290170 (Why is no real title available?)
- Partial triple systems and edge colourings
- scientific article; zbMATH DE number 3890249 (Why is no real title available?)
- Coloring cubic graphs by point-intransitive Steiner triple systems
- Strict colouring for classes of Steiner triple systems
- Bicolour graphs of Steiner triple systems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4457006)
