Greedy Colourings of Steiner Triple Systems

DOI10.1016/S0304-0208(08)73302-4zbMath0546.05009OpenAlexW1541384616MaRDI QIDQ3337474

Marlene J. Colbourn, Charles J. Colbourn

Publication date: 1983

Published in: Combinatorics '81 in honour of Beniamino Segre, Proceedings of the International Conference on Combinatorial Geometrics and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-0208(08)73302-4

zbMATH Keywords

greedy algorithmscolouring blocks

Mathematics Subject Classification ID

Triple systems (05B07)

Related Items

On deciding switching equivalence of graphs ⋮ Hanani triple systems ⋮ The optimal unicyclic graphs for pair-connected reliability ⋮ On line colorings of finite projective spaces ⋮ On chromatic indices of finite affine spaces ⋮ Every twofold triple system can be directed ⋮ Unbalanced Steiner triple systems