Cost colourings of hypergraphs (Q878618): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.disc.2005.11.067 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2093353227 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4099676 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3483299 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The colour theorems of Brooks and Gallai extended / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the cost-chromatic number of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Tight bounds on the chromatic sum of a connected graph / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 18:13, 25 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Cost colourings of hypergraphs |
scientific article |
Statements
Cost colourings of hypergraphs (English)
0 references
26 April 2007
0 references
Brooks-type theorem
0 references