2-reducible two paths and an edge constructing a path in (\(2k + 1\))-edge-connected graphs (Q604983): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s00373-010-0932-y / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00373-010-0932-Y / rank | |||
Normal rank | |||
Revision as of 04:44, 9 December 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
0 references
0 references
