On the decidability of certain integer subgraph problems on context-free graph languages (Q1333275)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the decidability of certain integer subgraph problems on context-free graph languages |
scientific article; zbMATH DE number 638566
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the decidability of certain integer subgraph problems on context-free graph languages |
scientific article; zbMATH DE number 638566 |
Statements
On the decidability of certain integer subgraph problems on context-free graph languages (English)
0 references
13 September 1994
0 references
decidability
0 references
integer subgraph problems
0 references
