2-reducible two paths and an edge constructing a path in (\(2k + 1\))-edge-connected graphs (Q604983)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: 2-reducible two paths and an edge constructing a path in (2k + 1)-edge-connected graphs |
scientific article; zbMATH DE number 5815674
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | 2-reducible two paths and an edge constructing a path in (\(2k + 1\))-edge-connected graphs |
scientific article; zbMATH DE number 5815674 |
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
0.91319597
0 references
0.91002846
0 references
0.9063336
0 references
0.8824983
0 references
0.85772604
0 references
