Bor-Liang Chen

activity

20092014

most citedEquitable Coloring of Graphs with Intermediate Maximum Degree

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

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2014★ 3 cited

Equitable Coloring of Graphs with Intermediate Maximum Degree

Bor-Liang Chen, Kuo-Ching Huang, Ko-Wei Lih

If the vertices of a graph $G$ are colored with $k$ colors such that no adjacent vertices receive the same color and the sizes of any two color classes differ by at most one, then…

math.CO2013

A Common Generalization of the Theorems of Erdős-Ko-Rado and Hilton-Milner

Wei-Tian Li, Bor-Liang Chen, Kuo-Ching Huang +1

Let $m$ , $n$ , and $k$ be integers satisfying $0 < k \leq n < 2 k \leq m$ . A family of sets $F$ is called an $(m, n, k)$ -intersecting family if $\binom{[n]}{k} \subseteq \mat…

math.CO2009

Equitable coloring of interval graphs and products of graphs

Bor-Liang Chen, Ko-Wei Lih, Jing-Ho Yan

We confirm the equitable $Δ$ -coloring conjecture for interval graphs and establish the monotonicity of equitable colorability for them. We further obtain results on equitable color…