# Kuo-Ching Huang

• Journal of Graph Theory
• 1997
A (k; g)-graph is a k-regular graph with girth g. Let f(k; g) be the smallest integer Î½ such there exists a (k; g)-graph with Î½ vertices. A (k; g)-cage is a (k; g)-graph with f(k; g) vertices. Inâ€¦ (More)
• Discrete Mathematics
• 1994
Let G =( V, E) be a graph. A bijectionf: V+{ 1,2,. ., 1 VI} IS called a prime labelling if for each e = {u, u} in E, we have GCD(f(u),f(u))= 1. A graph admits a prime labelling is called a primeâ€¦ (More)
Suppose D is a subset of all positive integers. The distance graph G(Z,D) with distance set D is the graph with vertex set Z, and two vertices x and y are adjacent if and only if |xâˆ’ y| âˆˆ D. Thisâ€¦ (More)
• Discrete Applied Mathematics
• 2000
For a xed positive integer k, the linear k-arboricity lak(G) of a graph G is the minimum number â€˜ such that the edge set E(G) can be partitioned into â€˜ disjoint sets and that each induces a subgraphâ€¦ (More)
• Discrete Mathematics
• 2002
A linear k-forest of a undirected graph G is a subgraph of G whose components are paths with lengths at most k. The linear k-arboricity of G, denoted by lak(G), is the minimum number of linearâ€¦ (More)
• Discrete Mathematics
• 1999
The total chromatic number gr(G) of a graph G is the least number of colors needed to color the vertices and the edges of G such that no adjacent or incident pair of elements receive the same color.â€¦ (More)