On chromaticity of hypergraphs (Q878636): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.disc.2005.11.079 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2069085582 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3941433 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Chromatic polynomials of hypergraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On chromatic equivalence of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A broken-circuits-theorem for hypergraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4860309 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On chromaticity of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Chromatic coefficients of linear uniform hypergraphs / rank | |||
Normal rank |
Latest revision as of 18:14, 25 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On chromaticity of hypergraphs |
scientific article |
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