Vertex-Critical Graphs and Coloring Obstructions

• Vertex-critical graphs are minimally k-chromatic structures that lose k-colorability when any vertex is removed, serving as minimal obstructions to (k-1)-colorability.
• Structural theorems reveal that families like gem and co-gem-free graphs are either complete or clique-expansions of C5, allowing explicit enumeration for low k values.
• Advanced techniques such as forbidden subgraph arguments and modular decomposition yield finite obstruction sets, which guide the design of certifying algorithms for graph coloring.

A vertex-critical graph is a graph $G$ for which the chromatic number $\chi(G)$ equals $k$ and, for every vertex $v \in V(G)$, the chromatic number of $G-v$ is strictly less than $k$. These graphs serve as the minimal obstructions to $(k-1)$-colorability under vertex deletions, making them central to the theory of graph coloring, finite forbidden-subgraph characterizations, and certifying algorithms.

1. Formal Definitions and Terminology

A graph $G$ is called $k$-vertex-critical if: $$\chi(G) = k \quad \text{and} \quad \chi(G-v) < k \qquad \forall v \in V(G)$$ where $\chi(G)$0 denotes the chromatic number. In this context, $\chi(G)$1 is vertex-critical with respect to proper vertex coloring, in the sense that every vertex is essential to maintaining the chromatic number $\chi(G)$2 (Abuadas et al., 2022).

Vertex-critical graphs are the minimal elements (under induced subgraph ordering) of the set of $\chi(G)$3-chromatic graphs. For hereditary graph classes $\chi(G)$4 (closed under induced subgraphs), the vertex-critical graphs in $\chi(G)$5 are of particular interest, as they serve as obstruction sets for colorability within $\chi(G)$6.

2. Core Results and Structural Theorems

Two classes of finiteness results are central to recent developments:

• Vertex-critical $\chi(G)$7-free Graphs: For all integers $\chi(G)$8 and $\chi(G)$9, there are only finitely many $k$0-vertex-critical graphs that exclude, as induced subgraphs, the disjoint union $k$1 (a 3-vertex path and $k$2 isolated vertices) (Abuadas et al., 2022).
• Vertex-critical (gem, co-gem)-free Graphs: For all $k$3, the only $k$4-vertex-critical graphs that are simultaneously gem-free and co-gem-free are either complete graphs $k$5 or clique expansions of the 5-cycle $k$6. This class is fully characterized, and explicit enumeration is possible for $k$7 (Abuadas et al., 2022).

The finiteness dichotomy for vertex-critical $k$8-free graphs is nearly resolved: for any fixed $k$9, the set of $v \in V(G)$0-vertex-critical, $v \in V(G)$1-free graphs is finite for all $v \in V(G)$2 if and only if $v \in V(G)$3 is an induced subgraph of one of $v \in V(G)$4, $v \in V(G)$5, or $v \in V(G)$6; the open case remains $v \in V(G)$7 (Abuadas et al., 2022).

3. Key Techniques and Proof Approaches

The proofs of finiteness for vertex-critical graphs in specific hereditary classes utilize a blend of forbidden subgraph arguments, Ramsey theory, and structural decompositions:

• Bounding Independent Sets: For $v \in V(G)$8-free graphs, the size of a maximum independent set $v \in V(G)$9 and the structure of $G-v$0 are tightly controlled by the forbidden induced subgraph. This yields explicit bounds on $G-v$1 and $G-v$2 (clique number), which, via Ramsey’s theorem, guarantee finiteness (Abuadas et al., 2022).
• Structural Templates and Expansions: For (gem, co-gem)-free graphs, a template-based approach is employed, relying on the fact that every such vertex-critical graph is either a complete graph or a clique-expansion of $G-v$3 (i.e., each vertex of $G-v$4 is replaced by a clique with adjacencies mirroring $G-v$5) (Abuadas et al., 2022).
• Modular Decomposition: The structure of certain forbidden-subgraph-free classes is decomposed into modules, with the property that any nontrivial module in a vertex-critical graph is itself a smaller vertex-critical graph, facilitating inductive arguments (Abuadas et al., 2022).

4. Enumeration and Explicit Obstruction Lists

The enumeration of vertex-critical graphs in some classes reaches complete explicitness. For (gem, co-gem)-free graphs, the count of vertex-critical graphs for $G-v$6 is given precisely by

$G-v$7

For $G-v$8, the non-complete graphs correspond to clique-expansions of $G-v$9 with parameters $k$0 such that $k$1 and $k$2 for cyclic indices $k$3 (Abuadas et al., 2022).

This explicitness enables certifying algorithms: for any graph in the class, one can generate or test for membership in the finite list of critical obstructions to verify $k$4-colorability.

5. Algorithmic and Structural Consequences

The finiteness of vertex-critical graphs in hereditary classes yields immediate algorithmic benefits:

• Certifying Algorithms: For any hereditary class where only finitely many $k$5-vertex-critical graphs exist, $k$6-colorability can be decided with a certifying algorithm: if the input is $k$7-colorable, exhibit a coloring; otherwise, exhibit an induced subgraph isomorphic to one of the known vertex-critical obstructions (Abuadas et al., 2022).
• Obstruction-based Characterization: These results provide, for broad classes, a finite set of forbidden induced subgraphs (the vertex-critical graphs) such that a graph is $k$8-colorable if and only if it avoids them.

This framework unifies obstruction theory in coloring, offering a finite method for verification in complexity-theoretically tractable classes.

6. Broader Context and Open Problems

The study of vertex-critical graphs in forbidden subgraph settings informs several major lines of inquiry:

• Sharp Boundaries: The transition from finite to infinite families of $k$9-vertex-critical graphs (as one varies the forbidden subgraphs) is a central structural dichotomy, associated with tractability in coloring and finite obstruction sets (Abuadas et al., 2022).
• Open Classes: The primary unresolved case is $(k-1)$0, where it remains unknown whether there are finitely many $(k-1)$1-vertex-critical $(k-1)$2-free graphs for all $(k-1)$3 and all $(k-1)$4 (Abuadas et al., 2022).
• Connection to Certifying Complexity: Understanding which hereditary classes admit finite obstruction lists for vertex-critical graphs is pivotal for the design of certifying algorithms and for explicit characterization of chromatic properties across graph classes.

The explicit structural characterizations and enumeration for classes such as (gem, co-gem)-free graphs advance the classification program in forbidden subgraph theory and shed light on minimal colorability obstructions, forming a foundation for future progress in graph coloring and hereditary constraint classes.