Vertex Cover Irredundance

• The paper establishes a novel irredundance framework by proving that the lower vertex cover irredundance parameter equals the conventional vertex cover number.
• Vertex cover irredundance is defined via the private-edge criterion, ensuring each vertex in a minimal cover uniquely covers an edge, which underpins its nonredundancy.
• The approach bridges covering and domination through extension problems, reconfiguration structures, and witness-based algorithms, offering new insights into graph optimization.

Searching arXiv for recent and foundational papers on vertex cover irredundance and extension variants. Vertex cover irredundance is the study of vertex subsets that cover edges in a graph in a nonredundant manner, in the sense that every chosen vertex is justified by at least one edge that would become uncovered if that vertex were removed. In its classical form, this is the private-edge characterization of minimal vertex covers. More recent work places the notion into a universal irredundance framework based on blocking sets, where edges serve as the natural blockers for vertex cover, yielding lower and upper vertex cover irredundance parameters and connecting them to domination-theoretic chains and TAR reconfiguration invariants (Curtis et al., 23 Sep 2025). A complementary algorithmic line studies irredundance through extension problems: given a prescribed set $U$, one asks whether $U$ can be embedded into a minimal vertex cover, thereby treating irredundance as a feasibility constraint rather than merely a structural property (Casel et al., 2018).

1. Definitions and core characterization

Let $G=(V,E)$ be a graph. A set $S \subseteq V$ is a vertex cover if every edge has at least one endpoint in $S$. A vertex cover is inclusion-wise minimal if no proper subset of it is a vertex cover. The decisive characterization is the private-edge criterion: $$S \text{ is a minimal vertex cover } \Longleftrightarrow \forall v \in S,\ \exists u \in N_G(v)\text{ with }u \notin S.$$ Equivalently, each $v \in S$ has an incident edge $vu$ such that $u \notin S$, so that edge is covered uniquely by $v$. In the language of irredundance, every vertex in the cover is irredundant because it contributes a private edge (Casel et al., 2018).

The universal blocking-set formulation abstracts this phenomenon. For vertex cover, the natural blocking family is the set of edges,

$U$0

viewing each edge as a two-element subset of $U$1. A set $U$2 is then vertex-cover irredundant if every $U$3 has a private blocker, namely an edge $U$4 with $U$5. This reproduces the classical private-edge notion exactly (Curtis et al., 23 Sep 2025).

Two numerical parameters arise. The lower vertex cover irredundance number is

$U$6

the minimum size of a maximal vertex-cover-irredundant set, and the upper vertex cover irredundance number is

$U$7

the maximum size of a maximal vertex-cover-irredundant set (Curtis et al., 23 Sep 2025).

A central fact is that the lower parameter collapses to the ordinary vertex cover number: $U$8 for all graphs (Curtis et al., 23 Sep 2025). Thus the lower irredundance notion does not introduce a new minimization invariant for vertex cover, whereas the upper parameter does.

2. Relation to minimal vertex cover and independent set duality

The complementarity between vertex covers and independent sets is fundamental. A set $U$9 is an independent set if $G=(V,E)$0, and an independent set is maximal if no proper superset remains independent. The complement of a maximal independent set is a minimal vertex cover; consequently, extension and irredundance statements for one side can be translated to the other (Casel et al., 2018).

This duality yields the identity

$G=(V,E)$1

and under the extension formalism it gives: $G=(V,E)$2 (Casel et al., 2018).

In the irredundance setting, duality clarifies the distinction between minimality and maximality. Minimal vertex cover is an inclusion condition certified locally by private edges; maximal independent set is the complementary inclusion condition certified by domination. The extension problem exploits this correspondence to transform minimal-cover feasibility into independent-set feasibility on a derived subgraph. This makes irredundance a bridge between covering and domination phenomena rather than a purely local covering condition (Casel et al., 2018).

The more recent universal theory further integrates vertex cover irredundance with domination irredundance. The Extended Domination Chain states

$G=(V,E)$3

placing upper vertex cover irredundance at the end of the chain (Curtis et al., 23 Sep 2025). This inclusion is explained by the fact that a domination-irredundant witness can induce a private edge, so every DIr-set is also VCIr.

3. Extension viewpoint and local witness structures

The extension problem for vertex cover is defined as follows. Given a graph $G=(V,E)$4 and a prescribed set $G=(V,E)$5, Ext VC asks whether there exists a minimal vertex cover $G=(V,E)$6 with $G=(V,E)$7 (Casel et al., 2018). This formulation isolates the irredundance burden to the requirement that all vertices of $G=(V,E)$8 must acquire private edges in some completion of $G=(V,E)$9 to a full minimal cover.

A precise structural characterization is given in terms of the closed neighborhood $S \subseteq V$0. The following are equivalent:

1. $S \subseteq V$1 is a yes-instance of Ext VC.
2. $S \subseteq V$2 is a yes-instance of Ext IS.
3. There exists an independent dominating set $S \subseteq V$3 of $S \subseteq V$4.

This is Theorem 2.3 in the extension paper (Casel et al., 2018). The condition translates irredundance into the existence of witness vertices outside $S \subseteq V$5 that are independent and dominate $S \subseteq V$6. If such an $S \subseteq V$7 exists, then taking the complement inside $S \subseteq V$8 yields a minimal vertex cover whose vertices in $S \subseteq V$9 each obtain a private edge into $S$0.

This equivalence is especially revealing conceptually. It shows that private-edge feasibility for a prescribed subset is neither purely local nor merely a matter of covering all incident edges. The witnesses assigned to distinct vertices of $S$1 must satisfy independence and domination constraints simultaneously. Conflicts arise when several vertices of $S$2 compete for witnesses in incompatible ways. This suggests that vertex cover irredundance is best viewed as a constrained witness-assignment problem on $S$3, rather than as a simple property of $S$4 itself.

The paper also notes a structural simplification: edges inside $S$5 cannot serve as private edges for Ext VC, so for the purpose of extension one may assume $S$6 is either a clique or an independent set (Casel et al., 2018). This observation separates feasibility from internal adjacencies of $S$7, emphasizing again that the essential obstructions lie in the outside witness structure.

4. Complexity landscape

Despite the tractability of ordinary Vertex Cover on many graph classes, enforcing irredundance through extension is often computationally difficult. Ext VC is NP-complete in cubic bipartite graphs (Casel et al., 2018). Since classical Vertex Cover is polynomial on bipartite graphs, this establishes a sharp separation between optimization of cover size and feasibility of minimality under preassignment.

Hardness persists under stronger restrictions. Ext IS is NP-complete on planar bipartite subcubic graphs, and by complement duality this extends to Ext VC (Casel et al., 2018). These results indicate that the difficulty comes from global consistency of private-edge witnesses rather than from dense or topologically unconstrained structure.

The parameterized picture with parameter $S$8 is similarly split. On general graphs, Ext VC is W[1]-complete, even on bipartite graphs (Casel et al., 2018). In contrast, on planar graphs the problem is fixed-parameter tractable with respect to $S$9, because the relevant induced graph $$S \text{ is a minimal vertex cover } \Longleftrightarrow \forall v \in S,\ \exists u \in N_G(v)\text{ with }u \notin S.$$0 has bounded outerplanarity and hence bounded treewidth (Casel et al., 2018).

The exact-exponential complexity of planar instances is near-optimal under ETH. Ext VC can be solved in time $$S \text{ is a minimal vertex cover } \Longleftrightarrow \forall v \in S,\ \exists u \in N_G(v)\text{ with }u \notin S.$$1 on planar graphs via treewidth-based dynamic programming that tracks both cover membership and private-edge status (Casel et al., 2018). The same paper proves that planar Ext VC on graphs of order $$S \text{ is a minimal vertex cover } \Longleftrightarrow \forall v \in S,\ \exists u \in N_G(v)\text{ with }u \notin S.$$2 has no $$S \text{ is a minimal vertex cover } \Longleftrightarrow \forall v \in S,\ \exists u \in N_G(v)\text{ with }u \notin S.$$3-time algorithm unless ETH fails (Casel et al., 2018). For bipartite subcubic instances, there is no $$S \text{ is a minimal vertex cover } \Longleftrightarrow \forall v \in S,\ \exists u \in N_G(v)\text{ with }u \notin S.$$4-time algorithm unless ETH fails (Casel et al., 2018).

These results delineate a recurring phenomenon: minimality constraints can convert a classically easy covering problem into a structurally richer problem governed by domination, reconfiguration-style locality, and witness compatibility.

5. Algorithms, reductions, and graph classes

The extension paper develops irredundance-aware reduction and branching rules for bounded-degree instances (Casel et al., 2018). Several reductions directly encode private-edge necessities:

• If $$S \text{ is a minimal vertex cover } \Longleftrightarrow \forall v \in S,\ \exists u \in N_G(v)\text{ with }u \notin S.$$5, answer yes.
• If some $$S \text{ is a minimal vertex cover } \Longleftrightarrow \forall v \in S,\ \exists u \in N_G(v)\text{ with }u \notin S.$$6 has degree $$S \text{ is a minimal vertex cover } \Longleftrightarrow \forall v \in S,\ \exists u \in N_G(v)\text{ with }u \notin S.$$7, answer no, because no private edge is possible.
• If $$S \text{ is a minimal vertex cover } \Longleftrightarrow \forall v \in S,\ \exists u \in N_G(v)\text{ with }u \notin S.$$8 has degree $$S \text{ is a minimal vertex cover } \Longleftrightarrow \forall v \in S,\ \exists u \in N_G(v)\text{ with }u \notin S.$$9, delete $v \in S$0.
• If $v \in S$1 with $v \in S$2, delete the edge $v \in S$3, since it cannot be private.
• If $v \in S$4 has degree $v \in S$5 with neighbor $v \in S$6, then $v \in S$7 must be private for $v \in S$8.
• If $v \in S$9 satisfies $vu$0, then $vu$1 can witness private edges for all its neighbors.

These rules are sound and express a common principle: irredundance can often be forced or ruled out by local degree structure (Casel et al., 2018).

For maximum degree $vu$2, a simple recursive algorithm that guesses a private neighbor for each vertex of $vu$3 runs in $vu$4 time (Casel et al., 2018). On subcubic graphs, more refined branching yields an exact algorithm in time $vu$5 (Casel et al., 2018). The same framework gives a linear kernel of size $vu$6 parameterized by $vu$7 (Casel et al., 2018).

Positive polynomial-time results occur in graph classes where the witness structure can be optimized through independent domination. Ext VC is polynomial-time decidable in chordal and in circular-arc graphs (Casel et al., 2018). The proof reduces the problem to weighted minimum independent dominating set on $vu$8, with weight $vu$9 on $u \notin S$0 and $u \notin S$1 outside it; the instance is feasible precisely when the optimum weight is $u \notin S$2 (Casel et al., 2018).

Trees admit a finer forbidden-structure characterization. For a tree $u \notin S$3 and an independent set $u \notin S$4, feasibility of Ext VC is equivalent to the absence of a particular induced edge-full black-white subtree belonging to a class $u \notin S$5 constructed inductively (Casel et al., 2018). This gives a purely combinatorial obstruction to irredundance and leads to linear-time algorithms on forests.

A separate but related algorithmic point from the universal irredundance framework is that recognition of a VCIr-set is straightforward: one verifies that the set is a vertex cover and that every chosen vertex has an incident edge to a vertex outside the set that is uniquely covered by it (Curtis et al., 23 Sep 2025). This is a local test, but maximality and optimization of VCIr-sets remain structurally more involved.

6. Numerical parameters, inequalities, and representative graph families

The universal theory gives the vertex cover interlace chain

$u \notin S$6

specializing the general inequality

$u \notin S$7

to the vertex cover setting (Curtis et al., 23 Sep 2025). Since $u \notin S$8, the lower end collapses, but the upper inequality can be strict.

The upper parameter $u \notin S$9 is bounded below by domination: $v$0 with $v$1 iff $v$2 (Curtis et al., 23 Sep 2025). This highlights the domination-theoretic content of upper irredundance: large VCIr-sets are forced when small dominating sets exist.

Several standard graph families illustrate the behavior precisely.

Graph family	Parameter values
$v$3	$v$4
$v$5	$v$6, $v$7
$v$8, $v$9, $U$00	$U$01, $U$02, $U$03
$U$04	$U$05, $U$06
$U$07, $U$08	$U$09, $U$10

These identities are all stated in the universal irredundance paper (Curtis et al., 23 Sep 2025).

The complete bipartite example is especially instructive. In $U$11 with $U$12, the upper irredundance exceeds the upper vertex cover number, showing that maximal irredundant cover-like sets can be substantially larger than minimal vertex covers (Curtis et al., 23 Sep 2025). This confirms that $U$13 captures a different extremal principle: unique coverage, not merely inclusion-wise minimality.

For disconnected graphs, isolated vertices are never part of a VCIr-set (Curtis et al., 23 Sep 2025). This is consistent with the private-edge criterion: an isolated vertex cannot justify its presence by covering any edge.

7. Optimization, reconfiguration, and generalizations

The extension framework also introduces the price of extension, which measures how closely a prescribed set can be fitted into a minimal vertex cover. For vertex cover, the relevant optimization problem is Max Ext VC: among all minimal vertex covers $U$14, maximize $U$15 (Casel et al., 2018). Its dual on the independent-set side is Min Ext IS, and the optimum values satisfy

$U$16

This turns irredundance from a decision constraint into a quantitative notion (Casel et al., 2018).

Approximability depends strongly on graph class. Max Ext VC is as hard as MaxIS to approximate on general graphs, even when $U$17 is an independent set (Casel et al., 2018). On bipartite graphs there is a polynomial-time $U$18-approximation, obtained by choosing the bipartition side containing more vertices of $U$19, since each side is a minimal vertex cover (Casel et al., 2018). On graphs of maximum degree $U$20, a $U$21-approximation is obtained via coloring of $U$22 and selection of a large neighborhood-dominating color class (Casel et al., 2018). Chordal and circular-arc graphs admit exact optimization through weighted independent domination (Casel et al., 2018).

The universal framework contributes a reconfiguration perspective. For vertex cover irredundance, the TAR graph $U$23 has as vertices all VCIr-sets, with adjacency defined by symmetric difference of size one (Curtis et al., 23 Sep 2025). A specialized isomorphism theorem states that if $U$24 and $U$25 have no isolated vertices and $U$26, then $U$27 and, after relabeling, the two graphs have exactly the same VCIr-sets (Curtis et al., 23 Sep 2025). This makes the family of irredundant vertex covers itself recoverable from the TAR structure.

An alternate universal account uses closure operators. For vertex cover,

$U$28

is a VC-compliant closure operator, and the associated blocking family generated by this closure has edge set as its generator family (Curtis et al., 23 Sep 2025). Thus the closure-theoretic and private-edge viewpoints coincide.

Finally, the extension paper generalizes beyond $U$29-cover. For a fixed biconnected graph $U$30, Ext $U$31-cover is NP-complete, and there is a characterization of minimal $U$32-covers extending $U$33 in terms of copies $U$34 intersecting $U$35 in exactly one vertex and inducing an $U$36-free graph outside $U$37 (Casel et al., 2018). A plausible implication is that the private-edge phenomenon for vertex cover is the simplest instance of a broader irredundance principle: each prescribed element must be certified by a witness structure that is uniquely attributable to it.

Vertex cover irredundance therefore occupies two closely related positions in contemporary graph theory. Structurally, it is the private-edge anatomy of minimal vertex covers. Universally, it is a blocking-set irredundance parameter whose lower value equals $U$38, whose upper value extends the domination chain, and whose TAR graph encodes strong invariants (Curtis et al., 23 Sep 2025). Algorithmically, it is the source of a family of extension and optimization problems whose complexity sharply departs from that of ordinary Vertex Cover, even on graph classes where covering itself is easy (Casel et al., 2018).