Coloring Block Designs is NP-Complete (Q3960717): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1137/0603031 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2032050111 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring Steiner quadruple systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On embedding incomplete symmetric Latin squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring Steiner Triple Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On chromatic number of graphs and set-systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4074927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial Steiner triple system of order n can be embedded in a Steiner triple system of order 6n + 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5615292 / rank
 
Normal rank

Latest revision as of 16:10, 13 June 2024

scientific article
Language Label Description Also known as
English
Coloring Block Designs is NP-Complete
scientific article

    Statements

    Coloring Block Designs is NP-Complete (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1982
    0 references
    partial Steiner triple systems
    0 references
    chromatic number
    0 references
    NP-complete problems
    0 references

    Identifiers

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