Complexity of diagrams (Q1316621): 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: Graph Theory and Probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: A remark on covering graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Probabilistic Graph-Theoretical Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial partitions of finite posets and lattices - Ramsey lattices / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf00340774 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2033798084 / rank
 
Normal rank

Latest revision as of 08:23, 30 July 2024

scientific article
Language Label Description Also known as
English
Complexity of diagrams
scientific article

    Statements

    Complexity of diagrams (English)
    0 references
    0 references
    0 references
    0 references
    16 February 1995
    0 references
    NP-completeness
    0 references
    diagram
    0 references
    undirected graph
    0 references
    covering relation
    0 references
    finite poset
    0 references

    Identifiers

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