公開日期 | 標題 | 作者 | 來源出版物 | scopus | WOS | 全文 |
2012 | Hamiltonian numbers of Möbius double loop networks | Chang, Gerard J.; Yang, Tzu-Hsiang; GERARD JENNHWA CHANG ; Chang, Ting-Pang; Sun, Yeali S.; Lai, Feipei; Tong, Li-Da | Journal of Combinatorial Optimization | 4 | 4 | |
2009 | Independent arcs of acyclic orientations of complete r-partite graphs | GERARD JENNHWA CHANG | Discrete Mathematics | 6 | 4 | |
2007 | Induced-path partition on graphs with special blocks | GERARD JENNHWA CHANG ; Pan, J. J.; Chang, G. J. | Theoretical Computer Science | 3 | 3 | |
1997 | Integral Distance Graphs | GERARD JENNHWA CHANG | Journal of Graph Theory | | | |
2000 | Integral Sum Numbers of Graphs | GERARD JENNHWA CHANG | Ars Combinatoria | | | |
2004 | Interval numbers of powers of block graphs | GERARD JENNHWA CHANG | Discrete Mathematics | 2 | 1 | |
2006 | Isometric path numbers of graphs | GERARD JENNHWA CHANG | Discrete Mathematics | 11 | 9 | |
2005 | Isometric-path numbers of block graphs | GERARD JENNHWA CHANG ; Pan, J. J.; Chang, G. J. | Information Processing Letters | 7 | 4 | |
2007 | Journal of Combinatorial Optimization: Editorial note | GERARD JENNHWA CHANG | Journal of Combinatorial Optimization | 0 | 0 | |
1998 | K-neighborhood-covering and -independence problems for chordal graphs | GERARD JENNHWA CHANG | SIAM Journal on Discrete Mathematics | | | |
1997 | K-path partitions in trees | GERARD JENNHWA CHANG | Discrete Applied Mathematics | | | |
2002 | K-Subdomination in graphs | GERARD JENNHWA CHANG | Discrete Applied Mathematics | 10 | 6 | |
2003 | k-tuple domination in graphs | GERARD JENNHWA CHANG | Information Processing Letters | 85 | 71 | |
2001 | The Kr-packing problem | Venkatesan; Rangan, C. Pandu; Chang, M.S.; 張鎮華 ; Wong, C.K.; Chang, G.J. | Computing | | | |
2009 | L (h, k)-labelings of Hamming graphs | GERARD JENNHWA CHANG | Discrete Mathematics | 5 | 6 | |
1988 | Labeling algorithms for domination problems in sun-free chordal graphs | GERARD JENNHWA CHANG | Discrete Applied Mathematics | 53 | 42 | |
2005 | Lecture Note for Graph Algorithms | Chang, Gerard-Jennhwa | | | | |
2000 | Linear k-arboricities on trees | GERARD JENNHWA CHANG | Discrete Applied Mathematics | | | |
2013 | A Linear-Time Algorithm for Finding Locally Connected Spanning Trees on Circular-Arc Graphs. | Lin, Ching-Chi; Chen, Gen-Huey; GERARD JENNHWA CHANG | Algorithmica | 2 | 1 | |
2011 | Local condition for planar graphs of maximum degree 7 to be 8-totally colorable | GERARD JENNHWA CHANG ; Chang, Gerard Jennhwa ; Hou, Jianfeng; Roussel, Nicolas | Discrete Applied Mathematics | 19 | 19 | |