The recognizability of sets of graphs is a robust property (Q2566292)
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: The recognizability of sets of graphs is a robust property |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The recognizability of sets of graphs is a robust property |
scientific article |
Statements
The recognizability of sets of graphs is a robust property (English)
0 references
22 September 2005
0 references
Recognizable set of graphs
0 references
Graph algebra
0 references
Hyperedge replacement
0 references
Vertex replacement
0 references
Quantifier-free definable operation
0 references
Locally finite congruence
0 references
Modular decomposition
0 references
0 references
0 references
