Generalized Color-Critical Graphs

• Generalized color-critical graphs are minimal-obstruction objects that extend classical k-criticality to hereditary, list, DP, and star-coloring frameworks.
• They unify distinct critical notions by applying vertex-minimal, edge-critical, and hypergraph-based criteria to characterize coloring thresholds and structural rigidity.
• Their study produces exact extremal results and algorithmic implications, linking chromatic thresholds, degree bounds, and recursive decomposition across various coloring models.

Generalized color-critical graphs are minimal-obstruction objects for coloring theories that extend ordinary chromatic criticality. In the classical case, a graph is $k$-critical if $\chi(G)=k$ and every proper subgraph is $(k-1)$-colorable; modern work extends the same minimality paradigm to hereditary graph classes, list and DP-coloring, property-based colorings, star coloring, hereditary hypergraphs, and several extremal settings in which color-criticality determines the exact extremal configuration (Dhaliwal et al., 2014, Schweser, 2018, Kostochka et al., 2019, Bernshteyn et al., 2024, Choudhary et al., 2023).

1. Foundational notions and scope

The subject now comprises several distinct but closely related criticality notions. Some are vertex-minimal or subgraph-minimal non-colorability notions; others are edge-criticality notions, where deleting one edge lowers the relevant chromatic parameter; still others are obstruction notions for list, DP, or property-based colorings. The shared theme is that a critical object is a smallest witness that a coloring threshold cannot be lowered.

Notion	Defining condition	Ambient framework
$k$-critical graph	$\chi(G)=k$ and every proper subgraph is $(k-1)$-colorable	Ordinary coloring
Color-critical graph	$G$ contains an edge $e$ such that $\chi(G-e)<\chi(G)$	Extremal graph theory
$(\mathcal P,L)$-critical hypergraph	$\chi(G)=k$0 is not $\chi(G)=k$1-colorable, but $\chi(G)=k$2 is for all $\chi(G)=k$3	Property colorings of hypergraphs
$\chi(G)=k$4-critical graph	Every proper induced subgraph $\chi(G)=k$5 satisfies $\chi(G)=k$6	Generalized DP-coloring
Strong $\chi(G)=k$7-chromatic-choosable graph	$\chi(G)=k$8 and every bad $\chi(G)=k$9-assignment is constant	List coloring
Robustly $(k-1)$0-critical graph	$(k-1)$1 is $(k-1)$2-critical and every bad $(k-1)$3-fold cover is canonical	DP-coloring
$(k-1)$4-critical for star coloring	$(k-1)$5 and $(k-1)$6 for every $(k-1)$7	Star coloring

In hereditary graph classes, critical graphs are naturally interpreted as minimal forbidden induced subgraphs for a coloring bound. In hereditary hypergraphs, Sebő replaces the chromatic number by the partition parameter $(k-1)$8, the minimum number of hyperedges covering the vertex set, and defines criticality by the condition $(k-1)$9 for every vertex $k$0 (Sebő, 2019). In smooth hypergraph-property colorings, Schweser studies $k$1-critical hypergraphs, where color classes are required to induce members of a hereditary property $k$2, and $k$3 is colorable for every vertex although $k$4 itself is not (Schweser, 2018). In generalized DP-coloring, Kostochka, Schweser, and Stiebitz define $k$5-critical graphs and the more local notion of a $k$6-critical cover, which functions as the natural obstruction object for correspondence coloring with property-constrained color classes (Kostochka et al., 2019).

This diversity suggests that “generalized color-critical graphs” are best understood not as a single class but as a family of minimal-obstruction theories sharing a common structural agenda: degree lower bounds, low-vertex decompositions, exact extremal constructions, and finite or recursive obstruction sets.

2. Structural principles and decomposition mechanisms

Several recurring principles organize generalized color-critical graph theory. In the class of $k$7-free graphs, critical graphs are connected, have no comparable vertices, and, if they are not cliques, have no clique cutset. Modules inherit criticality, joins preserve criticality exactly, and replacing a module by a clique of the same chromatic number preserves $k$8-criticality (Dhaliwal et al., 2014). These statements are not merely local lemmas: they allow criticality to descend through decomposition and then be rebuilt from smaller critical pieces.

For reliable graph properties $k$9, generalized DP-criticality has a parallel low-vertex theory. Writing $\chi(G)=k$0, a $\chi(G)=k$1-critical cover forces $\chi(G)=k$2 for every vertex. If equality holds, the vertex is low, and each block of the low-vertex subgraph is highly restricted: it is either a brick, or $\chi(G)=k$3 with $\chi(G)=k$4 $\chi(G)=k$5-regular, or $\chi(G)=k$6 with $\chi(G)=k$7 and $\chi(G)=k$8 (Kostochka et al., 2019). Schweser proves the analogous hypergraph statement for $\chi(G)=k$9-critical hypergraphs: if $(k-1)$0 is the low-vertex hypergraph, then each block of $(k-1)$1 is a brick, or belongs to $(k-1)$2 and is $(k-1)$3-regular, or already lies in $(k-1)$4 with maximum degree at most $(k-1)$5 (Schweser, 2018).

Sebő’s hereditary-hypergraph reformulation reveals the same Gallai-type mechanism from a different angle. In a connected, hereditary, critical hypergraph, $(k-1)$6; if equality holds, minimum covers consist of one singleton and edges only, and the graph of 2-element hyperedges is factor-critical (Sebő, 2019). This places matching theory at the core of generalized criticality: in the equality regime, larger hyperedges cease to matter, and the obstruction is controlled by a factor-critical graph.

A plausible implication is that generalized criticality is structurally rigid precisely when the coloring model admits a controllable “low part,” whether that part is a module decomposition, a brick decomposition, or a factor-critical 2-section.

3. Hereditary classes and finite obstruction theories

A particularly sharp hereditary example is the class of $(k-1)$7-free graphs. Let $(k-1)$8 denote the $(k-1)$9-critical members of this class. The central structure theorem states that $G$0 if and only if either $G$1 is the join of graphs in $G$2 and $G$3 with $G$4, or $G$5 is a buoy with bags $G$6 such that each $G$7, the cyclic constraints $G$8 hold, and $G$9 (Dhaliwal et al., 2014). The buoy, obtained from a $e$0 by substitution, is the class-specific template that plays the role of an irreducible non-perfect obstruction.

This recursive grammar yields a finiteness theorem: for every fixed $e$1, $e$2 is finite. The paper records the initial values

$e$3

and the counts

$e$4

(Dhaliwal et al., 2014). The contrast with $e$5-free graphs alone is decisive: there are infinitely many $e$6-critical $e$7-free graphs for every $e$8, while forbidding both $e$9 and $\chi(G-e)<\chi(G)$0 restores finiteness for every fixed $\chi(G-e)<\chi(G)$1.

The same finiteness result has an algorithmic consequence. Because every non-$\chi(G-e)<\chi(G)$2-colorable graph in the class contains an induced $\chi(G-e)<\chi(G)$3-critical subgraph, and because the obstruction family is finite for fixed $\chi(G-e)<\chi(G)$4, there is a certifying algorithm for fixed-$\chi(G-e)<\chi(G)$5 coloring of $\chi(G-e)<\chi(G)$6-free graphs (Dhaliwal et al., 2014). This is an archetypal finite-obstruction theorem: a hereditary coloring problem becomes a recursively generated obstruction theory with an effective NO-certificate.

4. Alternative coloring models and generalized criticality

Property-based coloring extends ordinary coloring by replacing “independent color classes” with color classes inducing members of a fixed hereditary property. In Schweser’s hypergraph framework, if $\chi(G-e)<\chi(G)$7 is non-trivial, hereditary, and additive with $\chi(G-e)<\chi(G)$8, then

$\chi(G-e)<\chi(G)$9

with equality only in explicitly listed exceptional cases involving complete graphs, odd cycles in the $(\mathcal P,L)$0 regime, or $(\mathcal P,L)$1-regular members of $(\mathcal P,L)$2 (Schweser, 2018). The generalized DP analogue has the same scaling parameter: if $(\mathcal P,L)$3 is reliable with $(\mathcal P,L)$4, then for connected simple graphs

$(\mathcal P,L)$5

except for complete graphs $(\mathcal P,L)$6, $(\mathcal P,L)$7-regular graphs in $(\mathcal P,L)$8, and cycles when $(\mathcal P,L)$9 (Kostochka et al., 2019). In both settings, $\chi(G)=k$00 plays the role that $\chi(G)=k$01 plays in classical critical graph theory.

List and DP variants introduce more refined notions of minimal obstruction. A graph is strong $\chi(G)=k$02-chromatic-choosable if $\chi(G)=k$03 and every bad $\chi(G)=k$04-assignment is constant; such graphs are chromatic-choosable and vertex-critical, and the join $\chi(G)=k$05 is strong $\chi(G)=k$06-chromatic-choosable (Kaul et al., 2018). The DP-strengthening is robust criticality: $\chi(G)=k$07 is robustly $\chi(G)=k$08-critical if $\chi(G)=k$09 is $\chi(G)=k$10-critical and every bad $\chi(G)=k$11-fold cover is canonical. If $\chi(G)=k$12 is critical with $\chi(G)=k$13 edges, then $\chi(G)=k$14 is strongly critical for all $\chi(G)=k$15, and robustly critical for all $\chi(G)=k$16 (Bernshteyn et al., 2024). This shows that generalized criticality can be forced by a large clique join even in the correspondence-coloring regime.

Star coloring gives a different generalization, because the obstruction is no longer merely adjacency but the existence of a 2-colored $\chi(G)=k$17. Here $\chi(G)=k$18 is $\chi(G)=k$19-critical if $\chi(G)=k$20 and $\chi(G)=k$21 for every edge. The 3-critical graphs are exactly $\chi(G)=k$22 and $\chi(G)=k$23. For non-complete graphs on $\chi(G)=k$24, $\chi(G)=k$25-criticality is characterized by $\chi(G)=k$26-freeness together with the property that every edge deletion creates an induced $\chi(G)=k$27 or $\chi(G)=k$28. Under the paper’s stated hypothesis that the graph contains $\chi(G)=k$29 or $\chi(G)=k$30, $\chi(G)=k$31-criticality is characterized by $\chi(G)=k$32-freeness together with the property that every edge deletion creates one of those induced subgraphs (Choudhary et al., 2023).

A distinct topological-combinatorial example comes from Schrijver graphs. For the 4-chromatic family,

$\chi(G)=k$33

and an edge is color-critical if and only if it is interlacing (Simonyi et al., 2019). This shows that generalized criticality can also be encoded by cyclic order and surface-embedding structure, not only by density or hereditary exclusion.

5. Extremal sparsity, degree bounds, and counting

The minimum-edge problem remains central. For ordinary critical graphs, if $\chi(G)=k$34 and $\chi(G)=k$35 is $\chi(G)=k$36-critical, then

$\chi(G)=k$37

This is sharp for every $\chi(G)=k$38, sharp for $\chi(G)=k$39 and every $\chi(G)=k$40, yields

$\chi(G)=k$41

and shows that Ore’s conjectured recurrence can fail for at most $\chi(G)=k$42 values of $\chi(G)=k$43 (Kostochka et al., 2012). The same result also produces a polynomial-time algorithm for $\chi(G)=k$44-coloring every graph $\chi(G)=k$45 such that $\chi(G)=k$46 for all $\chi(G)=k$47 with $\chi(G)=k$48 (Kostochka et al., 2012).

In DP-coloring, the Dirac phenomenon survives in sharp form. If $\chi(G)=k$49, $\chi(G)=k$50 is $\chi(G)=k$51-critical for a $\chi(G)=k$52-fold cover, $\chi(G)=k$53 has no clique of size $\chi(G)=k$54, and $\chi(G)=k$55, then

$\chi(G)=k$56

Equality can occur only for the classical family $\chi(G)=k$57, and the same consequence holds for list-critical graphs (Bernshteyn et al., 2016). This is structurally notable because DP-coloring permits even cycles to behave differently from list coloring, yet the sharp Dirac equality class remains unchanged.

The generalized DP and defective DP settings produce comparable quantitative constraints. For reliable $\chi(G)=k$58 with $\chi(G)=k$59, a simple $\chi(G)=k$60-critical graph with $\chi(G)=k$61 satisfies $\chi(G)=k$62 and, unless $\chi(G)=k$63,

$\chi(G)=k$64

For defective DP-coloring, if $\chi(G)=k$65 and $\chi(G)=k$66, then every DP-$\chi(G)=k$67-critical simple graph on $\chi(G)=k$68 vertices satisfies

$\chi(G)=k$69

and this bound is sharp for infinitely many $\chi(G)=k$70 (Kostochka et al., 2019, Kostochka et al., 2023).

Star-coloring criticality has its own extremal profile. For $\chi(G)=k$71-critical graphs,

$\chi(G)=k$72

and the upper bound is attained by the horn graph $\chi(G)=k$73. For $\chi(G)=k$74-critical graphs,

$\chi(G)=k$75

(Choudhary et al., 2023). These inequalities are qualitatively different from ordinary critical graph bounds, reflecting the fact that star coloring penalizes 2-colored $\chi(G)=k$76’s rather than only monochromatic edges.

6. Rainbow, Ramsey, and spectral manifestations

Color-criticality also governs exact extremal problems in nonstandard host models. For generalized books

$\chi(G)=k$77

with $\chi(G)=k$78, $\chi(G)=k$79, and sufficiently large $\chi(G)=k$80, the non-$\chi(G)=k$81-partite extremal number is

$\chi(G)=k$82

and the extremal family is exactly $\chi(G)=k$83 according to $\chi(G)=k$84. The value is the same as the known value of $\chi(G)=k$85 for large $\chi(G)=k$86 (Yu et al., 11 Aug 2025). In the rainbow Turán problem, if $\chi(G)=k$87 is $\chi(G)=k$88-color-critical with $\chi(G)=k$89, then for large $\chi(G)=k$90,

$\chi(G)=k$91

and

$\chi(G)=k$92

while for almost all $\chi(G)=k$93-color-critical graphs with $\chi(G)=k$94 the analogous threshold is $\chi(G)=k$95 (Chakraborti et al., 2022).

The multicolor Turán problem exhibits the same template. If $\chi(G)=k$96, $\chi(G)=k$97 is $\chi(G)=k$98-color-critical with $\chi(G)=k$99, $(k-1)$00 is sufficiently large, and

$(k-1)$01

then

$(k-1)$02

uniquely attained by $(k-1)$03 identical copies of $(k-1)$04 (Li et al., 2024). In Ramsey theory, if $(k-1)$05 is edge-critical with $(k-1)$06, $(k-1)$07, and $(k-1)$08 is sufficiently large, then

$(k-1)$09

(Jiang et al., 2023). This extends the exact formulas previously known for complete graphs and odd cycles to arbitrary edge-critical red graphs.

Spectral extremal theory reveals the same color-critical boundary. If $(k-1)$10 is color-critical with $(k-1)$11, then for sufficiently large $(k-1)$12, every $(k-1)$13-edge $(k-1)$14-free graph satisfies

$(k-1)$15

with equality if and only if $(k-1)$16 is a regular complete $(k-1)$17-partite graph (Li et al., 19 Nov 2025). Under Nikiforov’s condition

$(k-1)$18

a sufficiently large $(k-1)$19-edge graph contains at least $(k-1)$20 copies of any color-critical $(k-1)$21 with $(k-1)$22, and the leading constant $(k-1)$23 is optimal (Fang et al., 16 Mar 2026). In the signless Laplacian setting, if $(k-1)$24 is color-critical with $(k-1)$25, then for sufficiently large $(k-1)$26,

$(k-1)$27

with equality if and only if $(k-1)$28; as a consequence,

$(k-1)$29

with equality if and only if $(k-1)$30 is a regular Turán graph (Zheng et al., 10 Apr 2025).

Taken together, these results suggest that generalized color-critical graphs mark the exact point at which a forbidden configuration begins to enforce Turán-type multipartite structure, sharp density lower bounds, recursive obstruction theories, or canonical covers. Across ordinary coloring, hereditary restrictions, DP-coloring, star coloring, hypergraph property colorings, Ramsey theory, and spectral extremal theory, the same theme persists: criticality identifies the smallest structure whose presence rigidly changes the coloring or extremal behavior.