Name
Abstract | ||
|---|---|---|
In a recent paper Lovasz, Neumann-Lara and Plummer proved some Mengerian theorems for paths of bounded length. In this note the line connectivity analogue of their problem is considered. |
Year | DOI | Venue |
|---|---|---|
1983 | 10.1016/0012-365X(83)90197-8 | Discrete Mathematics |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Disjoint sets,Mathematics,Bounded function | Journal | 44 |
Issue | ISSN | Citations |
3 | Discrete Mathematics | 11 |
PageRank | References | Authors |
0.68 | 1 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Geoffrey Exoo | 1 | 187 | 39.86 |