Kuo-Ching Huang

most citedNordhaus-Guddam Type Relations of Three Graph Coloring Parameters

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

collaborators

2 papers

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.CO2012★ 1 cited

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…