2 citations · 2 across the 5 of their papers we have counts for
9 papers · 1 filter
The strong chromatic index of -free graphs
Richard Bi, Peter Bradshaw, Abhishek Dhawan +1
A strong edge coloring of a graph is an edge coloring such that each color class forms an induced matching in . The strong chromatic index…
A lower bound on the number of edges in DP-critical graphs. II. Four colors
Peter Bradshaw, Ilkyoo Choi, Alexandr Kostochka +1
A graph is -critical (list -critical, DP -critical) if (, ) and for every proper subgraph of , ($χ_\ell(…
A lower bound on the number of edges in DP-critical graphs
Peter Bradshaw, Ilkyoo Choi, Alexandr Kostochka +1
A graph is -critical (list -critical, DP -critical) if (, ) and for every proper subgraph of , ($χ_\ell(…
Sparse critical graphs for defective -coloring
Alexandr Kostochka, Jingwei Xu, Xuding Zhu
A graph is -colorable if its vertices can be partitioned into subsets and so that every vertex in has degree at most and every vertex in $G[V_2]…
Injective edge colorings of degenerate graphs and the oriented chromatic number
Peter Bradshaw, Alexander Clow, Jingwei Xu
Given a graph , an injective edge-coloring of is a function such that if , then no third edge joins an endpoint of and an en…
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 -defective DP-colorings of simple graphs. Define $g_{DP}(i,…