Recognizing string graphs is decidable (Q1864118)
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: Recognizing string graphs is decidable |
scientific article; zbMATH DE number 1883345
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Recognizing string graphs is decidable |
scientific article; zbMATH DE number 1883345 |
Statements
Recognizing string graphs is decidable (English)
0 references
17 March 2003
0 references
