A comparison of compatible, finite, and inductive graph properties (Q1812942)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 964
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A comparison of compatible, finite, and inductive graph properties |
scientific article; zbMATH DE number 964 |
Statements
A comparison of compatible, finite, and inductive graph properties (English)
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
