A comparison of compatible, finite, and inductive graph properties (Q1812942): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Hans-Joerg Kreowski / rank
 
Normal rank
Property / author
 
Property / author: Clemens Lautemann / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy problems for tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph expressions and graph rewritings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3785987 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic second-order evaluations on tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Plex languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyperedge replacement: grammars and languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3774975 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4694766 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metatheorems for decision problems on hyperedge replacement graph languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4711083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3795251 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995732 / rank
 
Normal rank

Latest revision as of 15:53, 14 May 2024

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