On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems (Q791320): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
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: On chromatic number of graphs and set-systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Endliche Vervollständigung endlicher partieller Steinerscher Systeme. (Finite completion of finite partial Steiner systems) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite partial quadruple systems can be finitely embedded / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Near-Optimal Graph Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2718910 / 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: A Survey of Embedding Theorems for Steiner Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near vector spaces over GF(q) and (v,q + 1,1) BIBDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The completion of finite incomplete Steiner triple systems with applications to loop theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring Block Designs is NP-Complete / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02579160 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2049432567 / rank
 
Normal rank

Latest revision as of 08:39, 30 July 2024

scientific article
Language Label Description Also known as
English
On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems
scientific article

    Statements

    On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems (English)
    0 references
    0 references
    0 references
    1984
    0 references
    algorithmic complexity
    0 references
    hypergraph coloring
    0 references
    Steiner systems
    0 references

    Identifiers

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