3 citations · 6 across the 9 of their papers we have counts for
10 papers
Equitable Coloring of Graphs with Intermediate Maximum Degree
Bor-Liang Chen, Kuo-Ching Huang, Ko-Wei Lih
If the vertices of a graph are colored with colors such that no adjacent vertices receive the same color and the sizes of any two color classes differ by at most one, then…
A Note on Near-factor-critical Graphs
Kuo-Ching Huang, Ko-Wei Lih
A near-factor of a finite simple graph is a matching that saturates all vertices except one. A graph is said to be near-factor-critical if the deletion of any vertex from $…
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…
The Minimum Number of Dependent Arcs and a Related Parameter of Generalized Mycielski Graphs
Hsin-Hao Lai, Ko-Wei Lih
Let D be an acyclic orientation of the graph G. An arc of D is dependent if its reversal creates a directed cycle. Let m(G) denote the minimum number of dependent arcs over all acy…