Let G be a graph that admits a perfect matching. A forcing set for a perfect matching M of G is
a subset S of M, such that S is contained in no other perfect matching of G. This notion has …

Let $ G $ be a graph that admits a perfect matching. A {\sf forcing set} for a perfect matching
$ M $ of $ G $ is a subset $ S $ of $ M $, such that $ S $ is contained in no other perfect …

Let G be a graph with vertices, and let S1; S2;:::; S be a list of colors on its vertices, each of
size k. If there exists a unique proper coloring for G from this list of colors, then G is called …

A geodetic set S ⊆ V (G) S⊆ V (G) of a graph G=(V, E) G=(V, E) is a restrained geodetic set
if the subgraph GV ∖ SGV\S has no isolated vertex. The minimum cardinality of a restrained …

When digital information is widely distributed in some fashion, the distributor would often like
to trace the source of pirate copies of the information. The paper surveys some of the …

Let G be a graph with n vertices and suppose that for each vertex v in G, there exists a list of
k colors L (v), such that there is a unique proper coloring for G from this collection of lists …

Let G be a graph with edge set E (G) that admits a perfect matching M. A forcing set of M is a
subset of M contained in no other perfect matchings of G. A global forcing set of GG …

Let G be a graph with edge set E (G) that admits a perfect matching M. A forcing set of M is a
subset of M contained in no other perfect matching of G. A complete forcing set of G, recently …

An important aspect of discrete optimization is to analyze the computational complexity of
combinatorial optimization problems. The polynomial hierarchy provides a proper …

The anti-forcing number of a perfect matching M of a graph G is the minimal number of
edges not in M whose removal to make M as a unique perfect matching of the resulting …