This paper first introduces a new graph parameter. Let t be a positive integer. A t-star-matching of a graph G is a collection of mutually vertex disjoint subgraphs K1,i of G with 1 ≤ i ≤ t. The ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results