Enumerating simple paths from connected induced subgraphs (Q1756087)
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: Enumerating simple paths from connected induced subgraphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Enumerating simple paths from connected induced subgraphs |
scientific article |
Statements
Enumerating simple paths from connected induced subgraphs (English)
0 references
11 January 2019
0 references
directed graph
0 references
self-avoiding walks
0 references
simple cycles
0 references
Hamiltonian paths
0 references
dominating sets
0 references
inclusion-exclusion
0 references
