公開日期 | 標題 | 作者 | 來源出版物 | scopus | WOS | 全文 |
1992 | Set to set broadcasting in communication networks | GERARD JENNHWA CHANG | Discrete Applied Mathematics | 15 | 13 | |
1997 | Signed Degree Sequences of Signed Graphs | GERARD JENNHWA CHANG | Journal of Graph Theory | | | |
1998 | Sortabilities of Partition Properties | GERARD JENNHWA CHANG | Journal of Combinatorial Optimization | | | |
2013 | Strong chromatic index of 2-degenerate graphs | GERARD JENNHWA CHANG | Journal of Graph Theory | 27 | 24 | |
2014 | Strong chromatic index of planar graphs with large girth | GERARD JENNHWA CHANG | Discussiones Mathematicae - Graph Theory | 10 | 12 | |
2012 | Strong edge-coloring for cubic Halin graphs | Chang, Gerard Jennhwa ; GERARD JENNHWA CHANG ; Liu, Daphne Der-Fen | Discrete Mathematics | 13 | 11 | |
2015 | Strong edge-coloring for jellyfish graphs | GERARD JENNHWA CHANG | Discrete Mathematics | 4 | 4 | |
2001 | A survey on circular chromatic numbers of graphs | 張鎮華 ; Chang, G.J. | AMS/IP Studies in Advanced Mathematics 20: | | | |
2006 | (t, k)-Diagnosis for Matching Composition Networks. | Chang, Guey-Yun; Chen, Gen-Huey; GEN-HUEY CHEN ; GERARD JENNHWA CHANG | IEEE Trans. Computers | 43 | 37 | |
1999 | T-colorings and T-edge spans of graphs | GERARD JENNHWA CHANG | Graphs and Combinatorics | | | |
1999 | The circular chromatic number of the Mycielskian of Gd k | GERARD JENNHWA CHANG | Journal of Graph Theory | | | |
2009 | The competition number of a graph with exactly h holes, all of which are independent | GERARD JENNHWA CHANG | Discrete Applied Mathematics | 14 | 13 | |
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 | | | |