The smallest graph variety containing all paths (Q1838985)
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 smallest graph variety containing all paths |
scientific article; zbMATH DE number 3805606
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The smallest graph variety containing all paths |
scientific article; zbMATH DE number 3805606 |
Statements
The smallest graph variety containing all paths (English)
0 references
1983
0 references
retract
0 references
reflexive graph
0 references
strong product
0 references
isometric subgraphs
0 references
