AbstractLet G be a graph with a perfect matching M. The forcing number of M is the smallest number of edges in a subset S⊂M such that S is contained in no other perfect matching of G. We present methods for determining bounds on forcing numbers and apply these methods to find bounds for the forcing numbers of stop signs. A consequence of our main result is that every perfect matching of a stop sign of size (n,k) contains at least n disjoint alternating cycles
In this paper, we study a dynamic coloring of the vertices of a graph G that starts with an initial ...
AbstractThe forcing number or the degree of freedom of a perfect matching M of a graph G is the card...
AbstractA criterion is proved for a graph of size ℵ1 or less to possess a perfect matching
Let G be a graph with a perfect matching M. The forcing number of M is the smallest number of edges ...
AbstractLet G be a graph with a perfect matching M. The forcing number of M is the smallest number o...
AbstractLet G be a graph that admits a perfect matching. The forcing number of a perfect matching M ...
Let G be a graph that admits a perfect matching. The forcing number of a perfect matching M of G is ...
AbstractThe forcing number of a perfect matching M of a graph G is the cardinality of the smallest s...
Let $G$ be a simple graph with $2n$ vertices and a perfect matching. We denote by $f(G)$ and $F(G)$ ...
AbstractLet G be a graph with a perfect matching M. Define the forcing number of M in G to be the sm...
Let $T$ be a square triangular grid with $n$ rows and columns of vertices and $n$ an even number. A ...
The global forcing number of a graph G is the minimal cardinality of an edge subset discriminating a...
AbstractLet G be a graph that admits a perfect matching. A forcing set for a perfect matching M of G...
Let $G$ be a simple graph with a perfect matching. Deng and Zhang showed thatthe maximum anti-forcin...
Abstract The anti-forcing number of a graph is the smallest number of edges that have to be removed ...
In this paper, we study a dynamic coloring of the vertices of a graph G that starts with an initial ...
AbstractThe forcing number or the degree of freedom of a perfect matching M of a graph G is the card...
AbstractA criterion is proved for a graph of size ℵ1 or less to possess a perfect matching
Let G be a graph with a perfect matching M. The forcing number of M is the smallest number of edges ...
AbstractLet G be a graph with a perfect matching M. The forcing number of M is the smallest number o...
AbstractLet G be a graph that admits a perfect matching. The forcing number of a perfect matching M ...
Let G be a graph that admits a perfect matching. The forcing number of a perfect matching M of G is ...
AbstractThe forcing number of a perfect matching M of a graph G is the cardinality of the smallest s...
Let $G$ be a simple graph with $2n$ vertices and a perfect matching. We denote by $f(G)$ and $F(G)$ ...
AbstractLet G be a graph with a perfect matching M. Define the forcing number of M in G to be the sm...
Let $T$ be a square triangular grid with $n$ rows and columns of vertices and $n$ an even number. A ...
The global forcing number of a graph G is the minimal cardinality of an edge subset discriminating a...
AbstractLet G be a graph that admits a perfect matching. A forcing set for a perfect matching M of G...
Let $G$ be a simple graph with a perfect matching. Deng and Zhang showed thatthe maximum anti-forcin...
Abstract The anti-forcing number of a graph is the smallest number of edges that have to be removed ...
In this paper, we study a dynamic coloring of the vertices of a graph G that starts with an initial ...
AbstractThe forcing number or the degree of freedom of a perfect matching M of a graph G is the card...
AbstractA criterion is proved for a graph of size ℵ1 or less to possess a perfect matching
DOI
Add to ORKG