1 citations · 1 across the 3 of their papers we have counts for
4 papers
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 , , and be integers satisfying . A family of sets is called an -intersecting family if $\binom{[n]}{k} \subseteq \mat…
Nordhaus-Guddam Type Relations of Three Graph Coloring Parameters
Kuo-Ching Huang, Ko-Wei Lih
Let G be a simple graph. A coloring of vertices of G is called (i) a 2-proper coloring if vertices at distance 2 receive distinct colors; (ii) an injective coloring if vertices pos…
An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph
Lianzhu Zhang, Weifan Wang, Ko-Wei Lih
An adjacent vertex distinguishing coloring of a graph G is a proper edge coloring of G such that any pair of adjacent vertices are incident with distinct sets of colors. The minimu…
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…