公開日期 | 標題 | 作者 | 來源出版物 | scopus | WOS | 全文 |
2015 | Max-Coloring of Vertex-Weighted Graphs | GERARD JENNHWA CHANG | Graphs and Combinatorics | 2 | 2 | |
1997 | Maximal independent sets in graphs with at most one cycle | GERARD JENNHWA CHANG | Discrete Applied Mathematics | | | |
1997 | Medians of graphs and kings of tournaments | GERARD JENNHWA CHANG | Taiwanese Journal of Mathematics | | | |
2001 | Minimum span of no-hole (r + 1)-distant colorings | GERARD JENNHWA CHANG | SIAM Journal on Discrete Mathematics | 4 | 4 | |
2010 | Multicompetition numbers of some multigraphs | GERARD JENNHWA CHANG | Ars Combinatoria | | | |
2011 | Near-automorphisms of paths | GERARD JENNHWA CHANG ; Chang, Gerard J. | Journal of Graph Theory | 1 | 1 | |
1999 | New comparisons in birnbaum importance for the consecutive-k-out-of-n system | GERARD JENNHWA CHANG | Probability in the Engineering and Informational Sciences | | | |
2007 | No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups | GERARD JENNHWA CHANG ; Chang, G. J.; Lu, C. H.; Zhou, S. M. | Discrete Mathematics | 8 | 7 | |
2001 | No-hole 2-distant colorings for unit interval graphs | GERARD JENNHWA CHANG | Ars Combinatoria | | | |
2007 | Node-disjoint paths in hierarchical hypercube networks | Wu, R.-Y.; Kuo, Y.-L.; GERARD JENNHWA CHANG ; Chen, Gen-Huey | Information Sciences | 55 | 48 | |
2002 | A note on Gallai-Roy-Vitaver Theorem | 張鎮華 ; L.D. Tong; J.H. Yan; Yeh, H.G.; Chang, G.J. | Discrete mathematics | | | |
2009 | Note on the m-step competition numbers of paths and cycles | Zhao, Y.; GERARD JENNHWA CHANG ; Zhao, Y. Q.; Chang, G. J. | Discrete Applied Mathematics | 10 | 9 | |
2011 | Note on two-φ-tolerance competition graphs | GERARD JENNHWA CHANG | Proceedings - 2010 1st ACIS International Symposium on Cryptography, and Network Security, Data Mining and Knowledge Discovery, E-Commerce and Its Applications, and Embedded Systems, CDEE 2010 | 0 | 0 | |
2013 | On a conjecture on the balanced decomposition number | GERARD JENNHWA CHANG | Discrete Mathematics | 1 | 1 | |
2010 | On competition polysemy and m-competition polysemy | GERARD JENNHWA CHANG | Ars Combinatoria | | | |
2008 | On fully orientability of 2-degenerate graphs | GERARD JENNHWA CHANG ; Lai, H.H.; Chang, G.J.; Lih, K.W. | Information Processing Letters | 6 | 4 | |
1999 | On k-ary spanning trees of tournaments | GERARD JENNHWA CHANG | Journal of Graph Theory | | | |
2000 | On L(d, 1)-labelings of graphs | GERARD JENNHWA CHANG | Discrete Mathematics | | | |
2010 | On minimum rank and zero forcing sets of a graph | Huang, Liang-Hao; GERARD JENNHWA CHANG ; Chang, Gerard J.; Yeh, Hong-Gwa | Linear Algebra and Its Applications | 40 | 33 | |
2007 | On the (n, t)-antipodal Gray codes | GERARD JENNHWA CHANG | Theoretical Computer Science | 4 | 2 | |