#### Filter Results:

- Full text PDF available (13)

#### Publication Year

1995

2016

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

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Hong-Gwa Yeh
- Discrete Mathematics
- 2002

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

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

- 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 lexicographic product G ◦ H it is shown that χ(G ◦ H) ≥ χf (G)χ(H). This bound has several consequences, in particular it unifies and extends several known lower… (More)

- Hong-Gwa Yeh, Gerard J. Chang
- Combinatorics and Computer Science
- 1995

Distance-hereditary graphs are graphs in which every two vertices have the same distance in every connected induced subgraph containing them. This paper studies distance-hereditary graphs from an algorithmic viewpoint. In particular, we present linear-time algorithms for finding a minimum weighted connected dominating set and a minimum vertex-weighted… (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 graph or a Hamming graph. We show that if G is a block-cactus graph, then the TARGET SET SELECTION problem can be solved in linear time, which generalizes… (More)

- Chun-Ying Chiang, Liang-Hao Huang, Hong-Gwa Yeh
- SIAM J. Discrete Math.
- 2013

Let G be a graph with a threshold function θ : V (G) → N such that 1 ≤ θ(v) ≤ dG(v) for every vertex v of G, where dG(v) is the degree of v in G. Suppose we are given a target set S ⊆ V (G). The paper considers the following repetitive process on G. At time step 0 the vertices of S are colored black and the other vertices are colored white. After that, at… (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 linear-time algorithm for the domination problem in distance-hereditary graphs by a labeling approach. We actually solve a more general problem, called the… (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 distance-hereditary graphs. In particular, we determine the structures of centers and medians of distance-hereditary and related graphs. The relations between eccentricity,… (More)

- Hong-Gwa Yeh, Gerard J. Chang
- Theor. Comput. Sci.
- 2001

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. This paper presents e-cient algorithms for solving the weighted connected k-domination and the weighted k-dominating clique problems in distance-hereditary graphs. c © 2001 Elsevier Science B.V. All rights reserved.