Maximal induced colorable subhypergraphs of all uncolorable BSTS(15)s

zbMATH Open1233.68180MaRDI QIDQ656561FDOQ656561

Authors: Jeremy Mathews 

Publication date: 18 January 2012

Published in: Computer Science Journal of Moldova (Search for Journal in Brave)

Recommendations

• All proper colorings of every colorable BSTS(15)
• Strict colourings of STS(\(3v\))s and uncolourable BSTS(\(3v\))s
• Triplication for BSTSs and uncolourability
• Lower and upper chromatic numbers for BSTSs\((2^h-1)\)
• Bicolour graphs of Steiner triple systems

zbMATH Keywords

(un)colorable subhypergraphsbi-Steiner triple system (BSTS)BSTS(15)

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Cited In (2)

• Triplication for BSTSs and uncolourability
• All proper colorings of every colorable BSTS(15)

This page was built for publication: Maximal induced colorable subhypergraphs of all uncolorable BSTS(15)s

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