\(H\)-colorings of dense hypergraphs (Q456171): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.ipl.2012.08.011 / rank | |||
Property / cites work | |||
Property / cites work: \(H\)-coloring dichotomy revisited / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4427278 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3424892 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The complexity of colouring problems on dense graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the complexity of H-coloring / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4828516 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new line of attack on the dichotomy conjecture / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A New Proof of the <i>H</i>-Coloring Dichotomy / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.IPL.2012.08.011 / rank | |||
Normal rank |
Latest revision as of 19:06, 9 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | \(H\)-colorings of dense hypergraphs |
scientific article |
Statements
\(H\)-colorings of dense hypergraphs (English)
0 references
23 October 2012
0 references
graph algorithms
0 references
hypergraph homomorphism
0 references
\(H\)-coloring
0 references
dense hypergraph
0 references