On equitable colorings of hypergraphs (Q2291188): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On a property of families of sets / 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: On a combinatorial problem. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5620621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5543308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for equitable coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable two-colorings of uniform hypergraphs / rank
 
Normal rank

Revision as of 14:31, 21 July 2024

scientific article
Language Label Description Also known as
English
On equitable colorings of hypergraphs
scientific article

    Statements

    On equitable colorings of hypergraphs (English)
    0 references
    30 January 2020
    0 references
    hypergraph
    0 references
    hypergraph coloring
    0 references
    equitable coloring
    0 references
    equitable two-coloring
    0 references

    Identifiers