公開日期 | 標題 | 作者 | 來源出版物 | scopus | WOS | 全文 |
---|---|---|---|---|---|---|
2012 | The competition number of a graph with exactly two holes | Li, Bo-Jr; GERARD JENNHWA CHANG ; Chang, Gerard J. | Journal of Combinatorial Optimization | 6 | 5 | |
1999 | The consecutive-4 digraphs are Hamiltonian | GERARD JENNHWA CHANG | Journal of Graph Theory | |||
2010 | The degree-preserving spanning tree problem in strongly chordal and directed path graphs | Lin, Ching-Chi; Chang, Gerard J.; Chen, Gen-Huey ; GERARD JENNHWA CHANG | Networks | 2 | 2 | |
1997 | The exact gossiping problem | GERARD JENNHWA CHANG | Discrete Mathematics | |||
1997 | The hamiltonian property of the consecutive-3 digraph | GERARD JENNHWA CHANG | Mathematical and Computer Modelling | 4 | 5 | |
1991 | The k-neighbor domination problem | GERARD JENNHWA CHANG | European Journal of Operational Research | 10 | 5 | |
2011 | The L(2, 1)-F-labeling problem of graphs | GERARD JENNHWA CHANG | Taiwanese Journal of Mathematics | |||
2003 | The L(2, 1)-labeling problem on ditrees | GERARD JENNHWA CHANG | Ars Combinatoria | |||
1996 | The L(2, 1)-labeling problem on graphs | GERARD JENNHWA CHANG | SIAM Journal on Discrete Mathematics | |||
2014 | The linear guessing number of undirected graphs | GERARD JENNHWA CHANG | Linear Algebra and Its Applications | 2 | 2 | |
1987 | The minimum of the antichains in the factor poset | GERARD JENNHWA CHANG | Order | 0 | 0 | |
1999 | The number of maximal independent sets in connected triangle-free graphs | GERARD JENNHWA CHANG | Discrete Mathematics | |||
2000 | The number of maximum independent sets in graphs | GERARD JENNHWA CHANG | Taiwanese Journal of Mathematics | |||
2015 | The number of steps and the final configuration of relaxation procedures on graphs | GERARD JENNHWA CHANG | Discrete Applied Mathematics | 0 | 0 | |
1996 | The partial gossiping problem | GERARD JENNHWA CHANG | Discrete Mathematics | |||
1998 | The path-partition problem in bipartite distance-hereditary graphs | GERARD JENNHWA CHANG | Taiwanese Journal of Mathematics | |||
1994 | The path-partition problem in block graphs | GERARD JENNHWA CHANG | Information Processing Letters | 20 | 0 | |
2005 | The PIGs full monty - A floor show of minimal separators | GERARD JENNHWA CHANG | Lecture Notes in Computer Science | |||
1985 | The poset scheduling problem | GERARD JENNHWA CHANG | Order | 7 | 5 | |
2008 | The upper bound on k-tuple domination numbers of graphs | GERARD JENNHWA CHANG | European Journal of Combinatorics | 15 | 13 |