#### Filter Results:

- Full text PDF available (10)

#### Publication Year

1991

2016

- This year (0)
- Last 5 years (4)
- Last 10 years (8)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Hung-Lin Fu, Kuo-Ching Huang, Christopher A. Rodger
- 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)

- Hung-Lin Fu, Kuo-Ching Huang
- 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)

This paper investigates the problem of factoring K2n âˆ’ In into 2-factors of two kinds or three kinds: (1) Ct-factors and C2t-factors, (2) C4-factors and C2t-factors, (3) C4-factors, C8-factors andâ€¦ (More)

- Gerard J. Chang, Bor-Liang Chen, Hung-Lin Fu, Kuo-Ching Huang
- 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)

- Yu-Lun Lu, Fu-Kuo Hsueh, +6 authors Ching-yi Wu
- IEEE Electron Device Letters
- 2010

In this letter, nanoscale p-MOS TFTs with a TiN gate electrode were realized using a novel microwave (MW) dopant-activation technique. We compared both low-temperature MW annealing and rapid thermalâ€¦ (More)

- Bor-Liang Chen, Kuo-Ching Huang
- 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)

- Hung-Lin Fu, Kuo-Ching Huang, Chih-Hung Yen
- Discrete Mathematics
- 2008

A linear k-forest is a forest whose components are paths of length at most k. The linear k-arboricity of a graph G, denoted by lak(G), is the least number of linear k-forests needed to decompose G.â€¦ (More)

- Bor-Liang Chen, Chun-Kan Cheng, Hung-Lin Fu, Kuo-Ching Huang
- Discrete Mathematics
- 1998

The total chromatic number z t (G) of a graph G is the least number of colors needed to color the vertices and edges of G so that no adjacent vertices or edges receive the same color, no incidentâ€¦ (More)

- Bor-Liang Chen, Lei Dong, Qi Zhang Liu, Kuo-Ching Huang
- 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)