Greedy Colourings of Steiner Triple Systems

DOI10.1016/S0304-0208(08)73302-4MaRDI QIDQ3337474zbMATH OpenOpenAlexFDO

Authors Charles J. Colbourn, Marlene 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)

Recommendations

• On colourings of Steiner triple systems
• Specialized block-colourings of Steiner triple systems and the upper chromatic index
• Unbalanced Steiner triple systems
• Strict colouring for classes of Steiner triple systems
• On list coloring Steiner triple systems

Cited in

(11)

• On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems
• The optimal unicyclic graphs for pair-connected reliability
• On line colorings of finite projective spaces
• Unbalanced Steiner triple systems
• Greedy triple systems
• Every twofold triple system can be directed
• scientific article; zbMATH DE number 4191647 (Why is no real title available?)
• On chromatic indices of finite affine spaces
• Hanani triple systems
• Strict colouring for classes of Steiner triple systems
• On deciding switching equivalence of graphs

This page was built for publication: Greedy Colourings of Steiner Triple Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3337474)