\((2, 2)\)-colourings and clique-free \(\sigma\)-hypergraphs (Q2341713): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4218535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-bounded hypergraphs. I: General results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-monochromatic non-rainbow colourings of \(\sigma\)-hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicoloring Steiner triple systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4074927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the construction of 3-chromatic hypergraphs with few edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Voloshin's colourings of \(P_{3}\)-designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending bicolorings for Steiner triple systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicolouring Steiner systems \(S\)(2,4,\(v\)) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3856819 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructions of sparse uniform hypergraphs with high chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring mixed hypergraphs: theory, algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudo-chordal mixed hypergraphs / rank
 
Normal rank

Revision as of 00:06, 10 July 2024

scientific article
Language Label Description Also known as
English
\((2, 2)\)-colourings and clique-free \(\sigma\)-hypergraphs
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references