Star chromatic numbers of hypergraphs and partial Steiner triple systems (Q1903717): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Alexander Rosa / rank | |||
Property / reviewed by | |||
Property / reviewed by: Alexander Rosa / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3223450 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on the star chromatic number / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Coloring Steiner Triple Systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The strong chromatic number of partial triple systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4026152 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On chromatic number of graphs and set-systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the complexity of H-coloring / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5680138 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5615292 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3770549 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Star chromatic number / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 08:49, 24 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Star chromatic numbers of hypergraphs and partial Steiner triple systems |
scientific article |
Statements
Star chromatic numbers of hypergraphs and partial Steiner triple systems (English)
0 references
26 August 1996
0 references
Author summary: The concept of star chromatic number of a graph introduced by \textit{A. Vince} [J. Graph Theory 12, No. 4, 551-559 (1988; Zbl 0658.05028)] is a natural generalization of the chromatic number of a graph. This concept was studied from a pure combinatorial point of view by \textit{J. A. Bondy} and \textit{P. Hell} [J. Graph Theory 14, No. 4, 479-482 (1990; Zbl 0706.05022)]. In this paper we introduce strong and weak star chromatic numbers of uniform hypergraphs and study their basic properties. In particular, we focus on partial Steiner triple systems (PSTS) for the weak case. We also discuss the computational complexity of finding a \((k,d)\)-colouring for a PSTS and construct, for every rational \(k/d > 2\), a \((k/d)\)-star chromatic PSTS.
0 references
star chromatic number
0 references
hypergraphs
0 references
partial Steiner triple systems
0 references
computational complexity
0 references
0 references