AP≥ k-factor of a graph G is a spanning subgraph F of G such that each component of F is a
path of order at least k (k≥ 2). Akiyama et al.[J. Akiyama, D. Avis, H. Era, On a {1, 2}-factor of …

Packing a maximum number of disjoint triangles into a given graph G is NP-hard, even for
most classes of structured graphs. In contrast, we show that packing a maximum number of …

Given a target graph G and a set G of k+-stars, that is, stars with at least k satellites, a k+-star
packing of G is a set of vertex-disjoint subgraphs of G with each isomorphic to some element …

A 3-star is a complete bipartite graph K 1, 3. A 3-star packing of a graph G is a collection of
vertex-disjoint subgraphs of G in which each subgraph is a 3-star. The maximum 3-star …

A matching of G can be viewed as a set of disjoint subgraphs of G each isomorphic to K2. A
natural generalization is a set of disjoint subgraphs each isomorphic to a fixed graph H, or to …

We define a problem called Simplex Matching and show that it is solvable in polynomial
time. While Simplex Matching is interesting in its own right as a nontrivial extension of …

This paper studies $ MPC^{5+} _v $, which is to cover as many vertices as possible in a
given graph $ G=(V, E) $ by vertex-disjoint $5^+ $-paths (ie, paths each with at least five …

Let ℋ be a family of graphs. An ℋ-packing of a graph G is a set {G 1, G 2,…, G k} of disjoint
subgraphs of G such that each G j is isomorphic to some element of ℋ. An ℋ-packing of a …

It is shown that a set of n disjoint line segments in the plane can always be illuminated by
⌊(n+1)/2⌋ light sources, improving an earlier bound of ⌊2n/3⌋ due to Czyzowicz et al. It is …

We define a problem called Simplex Matching, and show that it is solvable in polynomial
time. While Simplex Matching is interesting in its own right as a nontrivial extension of non …