2-reducible two paths and an edge constructing a path in (\(2k + 1\))-edge-connected graphs (Q604983): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 00:44, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | 2-reducible two paths and an edge constructing a path in (\(2k + 1\))-edge-connected graphs |
scientific article |
Statements
2-reducible two paths and an edge constructing a path in (\(2k + 1\))-edge-connected graphs (English)
0 references
12 November 2010
0 references
\(k\)-edge-connected
0 references
disjoint 2 paths
0 references
2-reducible
0 references
