J. Schroeder

most citedPolynomial

χ

-binding functions for

t

-broom-free graphs

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

collaborators

2 papers

math.CO2021

On the 3-colorability of triangle-free and fork-free graphs

Joshua Schroeder, Zhiyu Wang, Xingxing Yu

A graph $G$ is said to satisfy the Vizing bound if $χ (G) \leq ω (G) + 1$ , where $χ (G)$ and $ω (G)$ denote the chromatic number and clique number of $G$ , respectively. It was conjectured…

math.CO2021★ 3 cited

Polynomial $χ$ -binding functions for $t$ -broom-free graphs

Xiaonan Liu, Joshua Schroeder, Zhiyu Wang +1

For any positive integer $t$ , a \emph{ $t$ -broom} is a graph obtained from $K_{1, t + 1}$ by subdividing an edge once. In this paper, we show that, for graphs $G$ without induced $t$ -b…

On the 3-colorability of triangle-free and fork-free graphs

Polynomial χ-binding functions for t-broom-free graphs

Polynomial $χ$ -binding functions for $t$ -broom-free graphs