A comparison of compatible, finite, and inductive graph properties
type: Item
instance of: scholarly article
title: A comparison of compatible, finite, and inductive graph properties
zbMATH Open document ID: 0771.68079
DOI: 10.1016/0304-3975(93)90354-V
author: Annegret Habel
author: Hans-Jörg Kreowski
author: Clemens Lautemann
published in: Theoretical Computer Science
publication date: 1992-06-25T00:00:00Z
review text: See the preview in Zbl 0706.68068.
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 964
zbMATH Keywords: context-free graph grammar
zbMATH Keywords: decision problems
zbMATH Keywords: hyperedge-replacement
MaRDI profile type: Publication
cites work: Easy problems for tree-decomposable graphs
cites work: Graph expressions and graph rewritings
cites work: Q3785987
cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
cites work: Monadic second-order evaluations on tree-decomposable graphs
cites work: Plex languages
cites work: Hyperedge replacement: grammars and languages
cites work: Q3774975
cites work: Q4694766
cites work: Metatheorems for decision problems on hyperedge replacement graph languages
cites work: Q4711083
cites work: Q3795251
cites work: Q3995732
description: scientific article; zbMATH DE number 964