A comparison of compatible, finite, and inductive graph properties (Q1812942)

From MaRDI portal
Revision as of 22:21, 27 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A comparison of compatible, finite, and inductive graph properties
scientific article

    Statements

    A comparison of compatible, finite, and inductive graph properties (English)
    0 references
    0 references
    0 references
    0 references
    25 June 1992
    0 references
    See the preview in Zbl 0706.68068.
    0 references
    context-free graph grammar
    0 references
    decision problems
    0 references
    hyperedge-replacement
    0 references

    Identifiers