DM
2006
15 years 11 days ago
2006
The pair length of a graph G is the maximum positive integer k, such that the vertex set of G can be partitioned into disjoint pairs {x, x }, such that d(x, x ) k for every x V (...