When m vertices in a k-connected graph cannot be walked round along a simple cycle (Q1159693): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:24, 5 March 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
