Jingwei Xu

activity

20192026

most citedDefective DP-colorings of sparse multigraphs

2 citations · 3 across the 9 of their papers we have counts for

collaborators

9 papers

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 $ϕ : E (G) \to N$ such that each color class forms an induced matching in $G$ . The strong chromatic index…

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 $χ (G) = k$ ( $χ_{ℓ} (G) = k$ , $χ_{DP} (G) = k$ ) and for every proper subgraph $G^{'}$ of $G$ , $χ (G^{'}) < k$ ($χ_\ell(…

math.CO2024

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

Peter Bradshaw, Ilkyoo Choi, Alexandr Kostochka +1

math.CO2023

Sparse critical graphs for defective $(1, 3)$ -coloring

Alexandr Kostochka, Jingwei Xu, Xuding Zhu

A graph $G$ is $(1, 3)$ -colorable if its vertices can be partitioned into subsets $V_{1}$ and $V_{2}$ so that every vertex in $G [V_{1}]$ has degree at most $1$ and every vertex in $G[V_2]…

math.CO2023

Injective edge colorings of degenerate graphs and the oriented chromatic number

Peter Bradshaw, Alexander Clow, Jingwei Xu

Given a graph $G$ , an injective edge-coloring of $G$ is a function $ψ : E (G) \to N$ such that if $ψ (e) = ψ (e^{'})$ , then no third edge joins an endpoint of $e$ and an en…

math.CO2023

Sparse critical graphs for defective DP-colorings

Alexandr Kostochka, Jingwei Xu

An interesting generalization of list coloring is so called DP-coloring (named after Dvořák and Postle). We study $(i, j)$ -defective DP-colorings of simple graphs. Define $g_{DP}(i,…

math.CO2020★ 1 cited

Injective edge-coloring of graphs with given maximum degree

Alexandr Kostochka, André Raspaud, Jingwei Xu

A coloring of edges of a graph $G$ is injective if for any two distinct edges $e_{1}$ and $e_{2}$ , the colors of $e_{1}$ and $e_{2}$ are distinct if they are at distance $1$ in $G$ or in a…

math.CO2020

Defective DP-colorings of sparse simple graphs

Yifan Jing, Alexandr Kostochka, Fuhong Ma +1

DP-coloring (also known as correspondence coloring) is a generalization of list coloring developed recently by Dvořák and Postle. We introduce and study $(i, j)$ -defective DP-colori…

math.CO2019★ 2 cited

Defective DP-colorings of sparse multigraphs

Yifan Jing, Alexandr Kostochka, Fuhong Ma +2

DP-coloring (also known as correspondence coloring) is a generalization of list coloring developed recently by Dvorak and Postle. We introduce and study $(i, j)$ -defective DP-colori…

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

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

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

Sparse critical graphs for defective (1,3)-coloring

Injective edge colorings of degenerate graphs and the oriented chromatic number

Sparse critical graphs for defective DP-colorings

Injective edge-coloring of graphs with given maximum degree

Defective DP-colorings of sparse simple graphs

Defective DP-colorings of sparse multigraphs

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

Sparse critical graphs for defective $(1, 3)$ -coloring