Abstract
An integer k-matching of a graph G is a function h that assigns to each edge an integer in {0, ..., k} such that Sigma(e is an element of Gamma(v)) h(......
小提示:本篇文献需要登录阅读全文,点击跳转登录