Author

Richard Bi

h-index 3 View on Semantic Scholar

We have 1 of 10 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Open access Jul 2026

Flexible List Coloring of Graphs With Maximum Average Degree Less Than 3

In the flexible list coloring problem, we consider a graph and a color list assignment on , as well as a subset for which each has a preferred color . Our goal is to find a proper ‐coloring of such that for at least vertices . We say that is ‐flexibly ‐choosable if for every ‐size list assignment on and every sub...

Richard Bi, Peter Bradshaw · Journal of Graph Theory · 0 citations