On chromaticity of hypergraphs (Q878636)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On chromaticity of hypergraphs |
scientific article; zbMATH DE number 5146839
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On chromaticity of hypergraphs |
scientific article; zbMATH DE number 5146839 |
Statements
On chromaticity of hypergraphs (English)
0 references
26 April 2007
0 references
The authors consider an extension of the chromatic polynomial to hypergraphs and prove that uniform hypertrees and uniform unicyclic hypergraphs are chromatically characterized in the class of linear hypergraphs.
0 references
chromatic polynomial
0 references
hypergraph
0 references
hypertree
0 references
