公開日期 | 標題 | 作者 | 來源出版物 | scopus | WOS | 全文 |
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 | |
1998 | Localizing Combinatorial Properties for Partitions on Block Graphs | GERARD JENNHWA CHANG | Journal of Combinatorial Optimization | | | |
2007 | Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs | Lin, C.-C.; GERARD JENNHWA CHANG ; Chen, Gen-Huey | Discrete Mathematics | 5 | 4 | |
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 | |