#### Filter Results:

- Full text PDF available (8)

#### Publication Year

1995

2016

- This year (0)
- Last 5 years (3)
- Last 10 years (7)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Hong-Gwa Yeh
- Discrete Mathematics
- 2002

A binary matrix is said to be d-disjunct if the union (or Boolean sum) of any d columns does not contain any other column. Such matrices constitute a basis for nonadaptive group testing algorithmsâ€¦ (More)

- Sandi Klavzar, Hong-Gwa Yeh
- Discrete Mathematics
- 2002

It is shown that the difference between the chromatic number Ï‡ and the fractional chromatic number Ï‡f can be arbitrarily large in the class of uniquely colorable, vertex transitive graphs. For theâ€¦ (More)

- Hong-Gwa Yeh, Xuding Zhu
- Discrete Mathematics
- 2003

- Hong-Gwa Yeh, Xuding Zhu
- Theor. Comput. Sci.
- 2005

A graphG is used as a model for a resource sharing system, where each vertex represents a process and an edge joining two vertices means that the corresponding processes share a resource. Aâ€¦ (More)

- Chun-Ying Chiang, Liang-Hao Huang, Bo-Jr Li, Jiaojiao Wu, Hong-Gwa Yeh
- J. Comb. Optim.
- 2013

In this paper we consider a fundamental problem in the area of viral marketing, called TARGET SET SELECTION problem. We study the problem when the underlying graph is a block-cactus graph, a chordalâ€¦ (More)

- Gerard J. Chang, Fu-Loong Chen, +6 authors Hong-Gwa Yeh
- J. Comb. Optim.
- 1998

Consider the partition of a set of integers into parts. Various partition properties have been proposed in the literature to facilitate the restriction of the focus of attention to some small classâ€¦ (More)

- Hong-Gwa Yeh, Gerard J. Chang
- Discrete Mathematics
- 2003

A graph is distance-hereditary if the distance between any two vertices in a connected induced subgraph is the same as in the original graph. In this paper, we study metric properties ofâ€¦ (More)

- Maw-Shang Chang, Shaur-Ching Wu, Gerard J. Chang, Hong-Gwa Yeh
- Discrete Applied Mathematics
- 2002

The domination problem and its variants have been extensively studied in the literature. In this paper we investigate the domination problem in distance-hereditary graphs. In particular, we give aâ€¦ (More)

- Gerard J. Chang, Sheng-Chyang Liaw, Hong-Gwa Yeh
- Discrete Applied Mathematics
- 2002

For a positive integer k, a k-subdominating function of a graph G =(V; E) is a function f :V â†’{âˆ’1; 1} such that âˆ‘uâˆˆNG [v] f(u)Â¿ 1 for at least k vertices v of G. The ksubdomination number of G,â€¦ (More)

- Hong-Gwa Yeh
- ArXiv
- 2006

The main contributions of this paper are three-fold. First, we use a dynamic approach based on Reiterâ€™s pioneering work on Karp-Miller computation graphs [19] to give a new and short proof of Moharâ€™sâ€¦ (More)