Upper chromatic number of Steiner triple and quadruple systems

DOI10.1016/S0012-365X(97)80332-9zbMATH Open0901.05012MaRDI QIDQ1377792FDOQ1377792

Authors: Lorenzo Milazzo, Zsolt Tuza 

Publication date: 26 November 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

Recommendations

• Strict colorings of Steiner triple and quadruple systems: A survey
• scientific article; zbMATH DE number 851453
• scientific article; zbMATH DE number 5202627
• Lower and upper chromatic numbers for BSTSs\((2^h-1)\)
• A primal-dual property of the upper chromatic number of mixed hypergraphs
• scientific article; zbMATH DE number 5492378
• Chromatic spectrum is broken
• The chromatic spectrum of mixed hypergraphs
• Strict colouring for classes of Steiner triple systems
• Strict colourings for classes of 4-cycle systems

zbMATH Keywords

mixed hypergraphSteiner triple systemupper chromatic numberSteiner quadruple systemsstrict colouring

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Hypergraphs (05C65) Triple systems (05B07)

Cites Work

• On Quadruple Systems
• Title not available (Why is that?)
• Steiner quadruple systems - a survey
• 2-colourings in \(S(t, t+1, v)\)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (32)

• Circular mixed hypergraphs. II: The upper chromatic number
• Upper chromatic number of Steiner triple systems.
• Chromatic polynomials of mixed hypercycles
• Edge balanced star‐hypergraph designs and vertex colorings of path designs
• On the upper chromatic number of \((v_3,b_2)\)-configurations
• Triplication for BSTSs and uncolourability
• Voloshin's colourings of \(P_{3}\)-designs
• Strict colourings for classes of 4-cycle systems
• A primal-dual property of the upper chromatic number of mixed hypergraphs
• Mario Gionfriddo and mixed hypergraph coloring
• Bicolouring Steiner systems \(S\)(2,4,\(v\))
• Strict colouring for classes of Steiner triple systems
• Title not available (Why is that?)
• Strict colourings of STS(\(3v\))s and uncolourable BSTS(\(3v\))s
• Logarithmic upper bound for the upper chromatic number of \(S(t,t+1,v)\) systems
• Maximum number of colors: C-coloring and related problems
• Strict colorings of Steiner triple and quadruple systems: A survey
• Some equitably 3-colourable cycle decompositions
• Steiner systems and configurations of points
• Colouring 4-cycle systems with equitably coloured blocks
• 5‐chromatic steiner triple systems
• Mixed hypergraphs with bounded degree: Edge-coloring of mixed multigraphs.
• Mixed hypergraphs and beyond
• Uncolorable mixed hypergraphs
• On Voloshin colorings in 3-hypergraph designs
• Lower and upper chromatic numbers for BSTSs\((2^h-1)\)
• The monochromatic block number
• A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2
• Coloring mixed hypertrees
• Nonorientable triangular embeddings of complete graphs with arbitrarily large looseness
• Extended bicolorings of Steiner triple systems of order \(2^{h}-1\)
• On some colouring of 4-cycle systems with specified block colour patterns

This page was built for publication: Upper chromatic number of Steiner triple and quadruple systems

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