Jingwei Xu

math.CO2026

A lower bound on the number of edges in DP-critical graphs

Peter Bradshaw, Ilkyoo Choi, Alexandr Kostochka +1

A graph $G$ is $k$ -critical (list $k$ -critical, DP $k$ -critical) if $I ¨ (G) = k$ ( $I ¨ _{ℓ} (G) = k$ , $I ¨ _{DP} (G) = k$ ) and for every proper subgraph $G^{'}$ of $G$ , $I ¨ (G^{'}) < k$ ($Ï_…

math.CO2026

The strong chromatic index of $K_{t, t}$ -free graphs

Richard Bi, Peter Bradshaw, Abhishek Dhawan +1

A strong edge coloring of a graph $G$ is an edge coloring $I ¨ : E (G) \to N$ such that each color class forms an induced matching in $G$ . The strong chromatic inde…

math.CO2024

A lower bound on the number of edges in DP-critical graphs. II. Four colors

Peter Bradshaw, Ilkyoo Choi, Alexandr Kostochka +1

A graph $G$ is $k$ -critical (list $k$ -critical, DP $k$ -critical) if $I ¨ (G) = k$ ( $I ¨ _{ℓ} (G) = k$ , $I ¨ _{DP} (G) = k$ ) and for every proper subgraph $G^{'}$ of $G$ , $I ¨ (G^{'}) < k$ ($Ï_…

A lower bound on the number of edges in DP-critical graphs

The strong chromatic index of Kt,t​-free graphs

A lower bound on the number of edges in DP-critical graphs. II. Four colors

The strong chromatic index of $K_{t, t}$ -free graphs