Circular mixed hypergraphs. II: The upper chromatic number (Q2495897)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5037787
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Circular mixed hypergraphs. II: The upper chromatic number |
scientific article; zbMATH DE number 5037787 |
Statements
Circular mixed hypergraphs. II: The upper chromatic number (English)
0 references
30 June 2006
0 references
Authors extend results from Part I [Congr. Numerantium 144, 207--219 (2000; Zbl 0974.05037)] and prove that for every reduced colourable circular mixed hypergraph with order \(n\), upper chromatic number \(\overline\chi\) and sieve number \(s\) holds \(n-s-2\leq \overline\chi\leq n-s+2\).
0 references
graph and hypergraph coloring
0 references
mixed hypergraphs
0 references
upper chromatic number
0 references
0.8587238788604736
0 references
0.8587236404418945
0 references
0.8376571536064148
0 references
0.8353842496871948
0 references
0.8307961821556091
0 references
