When m vertices in a k-connected graph cannot be walked round along a simple cycle (Q1159693): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:41, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | When m vertices in a k-connected graph cannot be walked round along a simple cycle |
scientific article |
Statements
When m vertices in a k-connected graph cannot be walked round along a simple cycle (English)
0 references
1982
0 references
cycles
0 references
