Traversing every edge in each direction once, but not at once: Cubic (polyhedral) graphs (Q5006611)
From MaRDI portal
scientific article; zbMATH DE number 7382295
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Traversing every edge in each direction once, but not at once: Cubic (polyhedral) graphs |
scientific article; zbMATH DE number 7382295 |
Statements
Traversing every edge in each direction once, but not at once: Cubic (polyhedral) graphs (English)
0 references
16 August 2021
0 references
cubic graph
0 references
spanning tree
0 references
cotree
0 references
retracting-free bidirectional circuit
0 references
