Greedy colorings of uniform hypergraphs (Q3055773): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Every 8-uniform 8-regular hypergraph is 2-colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 3-chromatic hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring uniform hypergraphs with few colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds and algorithms for hypergraph 2-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ein kombinatorisches Problem von P. Erdős und A. Hajnal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring n-sets red and blue / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Even Cycle Problem for Directed Graphs / rank
 
Normal rank

Latest revision as of 10:33, 3 July 2024

scientific article
Language Label Description Also known as
English
Greedy colorings of uniform hypergraphs
scientific article

    Statements

    Identifiers