Detecting cycles through three fixed vertices in a graph (Q1198018)
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: Detecting cycles through three fixed vertices in a graph |
scientific article; zbMATH DE number 92088
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Detecting cycles through three fixed vertices in a graph |
scientific article; zbMATH DE number 92088 |
Statements
Detecting cycles through three fixed vertices in a graph (English)
0 references
16 January 1993
0 references
graph algorithms
0 references
subgraph homeomorphism problem
0 references
linear time algorithm
0 references
cycle
0 references
decompositions
0 references
