Add to ORKGAbstract. An independent set Ic is a critical independent set if |Ic|−|N(Ic) | ≥ |J | − |N(J)|, for any independent set J. The critical independence number of a graph is the cardinality of a maximum critical independent set. This num-ber is a lower bound for the independence number and can be computed in polynomial-time. Any graph can be decomposed into two subgraphs where the independence number of one subgraph equals its critical independence num-ber, where the critical independence number of the other subgraph is zero, and where the sum of the independence numbers of the subgraphs is the inde-pendence number of the graph. A proof of a conjecture of Graffiti.pc yields a new characterization of König-Egervary graphs: these are exactly th...
The independence polynomial I(G;x) of a graph G is I(G;x)=∑k=0 α(G)skxk, where sk is the number of i...
In 1968, Vizing conjectured that, if G is a Delta-critical graph with n vertices, then alpha(G) \u3c...
The independence polynomial I(G;x) of a graph G is I(G;x)=∑k=0 α(G)skxk, where sk is the number of i...
AbstractAn independent set Ic is a critical independent set if |Ic|−|N(Ic)|≥|J|−|N(J)|, for any inde...
An independent set Ic is a critical independent set if |Ic | − |N(Ic) | ≥ |J | − |N(J)|, for any ...
In 1968, Vizing conjectured that, if G is a Δ-critical graph with n vertices, then α (G) ≤ n / 2, wh...
In 1968, Vizing conjectured that, if G is a Δ-critical graph with n vertices, then α (G) ≤ n / 2, wh...
In the master's thesis we are dealing with the independence number of a graph. We show, that the wel...
An independent set in a graph is a set of vertices which are pairwise non-adjacent. An independ-ent ...
The independence number of a graph G, denoted (G), is the maximum cardi- nality of an independent ...
AbstractIn 1968, Vizing conjectured that, if G is a Δ-critical graph with n vertices, then α(G)≤n2, ...
In 1968, Vizing conjectured that, if G is a Δ-critical graph with n vertices, then α (G) ≤ frac(n, 2...
In 1968, Vizing conjectured that, if G is a Δ-critical graph with n vertices, then α (G) ≤ frac(n, 2...
AbstractIn a graph G=(V,E) of order n and maximum degree Δ, a subset S of vertices is a k-independen...
Let G = (V,E) be a graph and k > 0 an integer. A k-independent set S V is a set of vertices such t...
The independence polynomial I(G;x) of a graph G is I(G;x)=∑k=0 α(G)skxk, where sk is the number of i...
In 1968, Vizing conjectured that, if G is a Delta-critical graph with n vertices, then alpha(G) \u3c...
The independence polynomial I(G;x) of a graph G is I(G;x)=∑k=0 α(G)skxk, where sk is the number of i...
AbstractAn independent set Ic is a critical independent set if |Ic|−|N(Ic)|≥|J|−|N(J)|, for any inde...
An independent set Ic is a critical independent set if |Ic | − |N(Ic) | ≥ |J | − |N(J)|, for any ...
In 1968, Vizing conjectured that, if G is a Δ-critical graph with n vertices, then α (G) ≤ n / 2, wh...
In 1968, Vizing conjectured that, if G is a Δ-critical graph with n vertices, then α (G) ≤ n / 2, wh...
In the master's thesis we are dealing with the independence number of a graph. We show, that the wel...
An independent set in a graph is a set of vertices which are pairwise non-adjacent. An independ-ent ...
The independence number of a graph G, denoted (G), is the maximum cardi- nality of an independent ...
AbstractIn 1968, Vizing conjectured that, if G is a Δ-critical graph with n vertices, then α(G)≤n2, ...
In 1968, Vizing conjectured that, if G is a Δ-critical graph with n vertices, then α (G) ≤ frac(n, 2...
In 1968, Vizing conjectured that, if G is a Δ-critical graph with n vertices, then α (G) ≤ frac(n, 2...
AbstractIn a graph G=(V,E) of order n and maximum degree Δ, a subset S of vertices is a k-independen...
Let G = (V,E) be a graph and k > 0 an integer. A k-independent set S V is a set of vertices such t...
The independence polynomial I(G;x) of a graph G is I(G;x)=∑k=0 α(G)skxk, where sk is the number of i...
In 1968, Vizing conjectured that, if G is a Delta-critical graph with n vertices, then alpha(G) \u3c...
The independence polynomial I(G;x) of a graph G is I(G;x)=∑k=0 α(G)skxk, where sk is the number of i...