A broken-circuits-theorem for hypergraphs (Q1345852)
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: A broken-circuits-theorem for hypergraphs |
scientific article; zbMATH DE number 734511
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A broken-circuits-theorem for hypergraphs |
scientific article; zbMATH DE number 734511 |
Statements
A broken-circuits-theorem for hypergraphs (English)
0 references
22 May 1995
0 references
We define the chromatic polynomial of a hypergraph and establish a generalisation of Whitney's broken-circuits-theorem.
0 references
chromatic polynomial
0 references
hypergraph
0 references
broken-circuits-theorem
0 references
0.9425302
0 references
0.9281915
0 references
0.90167296
0 references
0.89267987
0 references
0 references
0.88548285
0 references
0.87935114
0 references
0 references
