Richard Bi

activity

20222026

collaborators

5 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…

cs.DS2024

Monotone Submodular Multiway Partition

Richard Bi, Karthekeyan Chandrasekaran, Soham Joshi

In submodular multiway partition (SUB-MP), the input is a non-negative submodular function $f : 2^{V} \to R_{\geq 0}$ given by an evaluation oracle along with $k$ termi…

math.CO2024

Graphs of maximum average degree less than $\frac{11}{3}$ are flexibly $4$ -choosable

Richard Bi, Peter Bradshaw

We consider the flexible list coloring problem, in which we have a graph $G$ , a color list assignment $L : V (G) \to 2^{N}$ , and a set $U \subseteq V (G)$ of vertices s…

math.CO2023

Flexible list coloring of graphs with maximum average degree less than $3$

Richard Bi, Peter Bradshaw

In the flexible list coloring problem, we consider a graph $G$ and a color list assignment $L$ on $G$ , as well as a subset $U \subseteq V (G)$ for which each $u \in U$ has a preferr…

math.CO2022

Rainbow Connection for Complete Multipartite Graphs

Igor Araujo, Kareem Benaissa, Richard Bi +3

A path in an edge-colored graph is said to be rainbow if no color repeats on it. An edge-colored graph is said to be rainbow $k$ -connected if every pair of vertices is connected by…

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

Monotone Submodular Multiway Partition

Graphs of maximum average degree less than 311​ are flexibly 4-choosable

Flexible list coloring of graphs with maximum average degree less than 3

Rainbow Connection for Complete Multipartite Graphs

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

Graphs of maximum average degree less than $\frac{11}{3}$ are flexibly $4$ -choosable

Flexible list coloring of graphs with maximum average degree less than $3$