Minimum number of edges in graphs that are both \(P_ 2-\) and \(P_ i- \)connected (Q1173099)
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: Minimum number of edges in graphs that are both \(P_ 2-\) and \(P_ i- \)connected |
scientific article; zbMATH DE number 3792202
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum number of edges in graphs that are both \(P_ 2-\) and \(P_ i- \)connected |
scientific article; zbMATH DE number 3792202 |
Statements
Minimum number of edges in graphs that are both \(P_ 2-\) and \(P_ i- \)connected (English)
0 references
1983
0 references
P(i)-connected
0 references
elementary path
0 references
