Issue Date | Title | Author(s) | Source | scopus | WOS | Fulltext/Archive link |
2011 | A characterization of graphs with rank 4 | Chang, Gerard J.; GERARD JENNHWA CHANG ; Huang, Liang-Hao; Yeh, Hong-Gwa | Linear Algebra and Its Applications | 69 | 60 | |
2012 | A characterization of graphs with rank 5 | Chang, Gerard J.; GERARD JENNHWA CHANG ; Huang, Liang-Hao; Yeh, Hong-Gwa | Linear Algebra and Its Applications | 63 | 59 | |
1996 | A finiteness theorem for maximal independent sets | GERARD JENNHWA CHANG | Graphs and Combinatorics | | | |
2009 | A note on equitable colorings of forests | Chang, G. J.; GERARD JENNHWA CHANG | European Journal of Combinatorics | 13 | 8 | |
2002 | A note on the Gallai-Roy-Vitaver Theorem | GERARD JENNHWA CHANG | Discrete Mathematics | | | |
2010 | A note on universally optimal matrices and field independence of the minimum rank of a graph | Huang, Liang-Hao; GERARD JENNHWA CHANG ; Chang, Gerard J.; Yeh, Hong-Gwa | Linear Algebra and Its Applications | 3 | 3 | |
2013 | A short proof for Chen's Alternative Kneser Coloring Lemma | GERARD JENNHWA CHANG | Journal of Combinatorial Theory. Series A | 9 | 11 | |
2008 | Adaptive group testing for consecutive positives | GERARD JENNHWA CHANG ; Juan, J.S.T.; Chang, G.J. | Discrete Mathematics | 9 | 8 | |
2002 | Algorithmic aspect of k-tuple domination in graphs | GERARD JENNHWA CHANG | Taiwanese Journal of Mathematics | | | |
2002 | Algorithmic aspects of counting independent sets | GERARD JENNHWA CHANG | Ars Combinatoria | | | |
1999 | Algorithmic aspects of linear k-arboricity | GERARD JENNHWA CHANG | Taiwanese Journal of Mathematics | | | |
1997 | Algorithmic aspects of majority domination | GERARD JENNHWA CHANG | Taiwanese Journal of Mathematics | | | |
1996 | Algorithmic aspects of the generalized clique-transversal problem on chordal graphs | GERARD JENNHWA CHANG | Discrete Applied Mathematics | 28 | 24 | |
2013 | Algorithmic aspects of the k-domination problem in graphs | GERARD JENNHWA CHANG | Discrete Applied Mathematics | 23 | 15 | |
1990 | An upper bound for the transversal numbers of 4-uniform hypergraphs | GERARD JENNHWA CHANG | Journal of Combinatorial Theory, Series B | 48 | 41 | |
2013 | B-chromatic numbers of powers of paths and cycles | GERARD JENNHWA CHANG | Discrete Applied Mathematics | 3 | 2 | |
2013 | B-coloring of tight bipartite graphs and the Erdös-Faber-Lovász conjecture | GERARD JENNHWA CHANG | Discrete Applied Mathematics | 8 | 9 | |
2012 | Balanced k-decompositions of graphs | GERARD JENNHWA CHANG | Discrete Applied Mathematics | 1 | 1 | |
2014 | Bandwidth sums of block graphs and cacti | GERARD JENNHWA CHANG | Journal of Combinatorial Optimization | 0 | 0 | |
1999 | Bipartite Steinhaus graphs | GERARD JENNHWA CHANG | Taiwanese Journal of Mathematics | | | |