公開日期 | 標題 | 作者 | 來源出版物 | scopus | WOS | 全文 |
---|---|---|---|---|---|---|
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 | |||
2003 | Centers and medians of distance-hereditary graphs | GERARD JENNHWA CHANG | Discrete Mathematics | 15 | 15 | |
1991 | Centers of chordal graphs | GERARD JENNHWA CHANG | Graphs and Combinatorics | 12 | 9 | |
2001 | Channel graphs of bit permutation networks | GERARD JENNHWA CHANG | Theoretical Computer Science | 3 | 3 | |
1999 | Characterizations of bipartite Steinhaus graphs | GERARD JENNHWA CHANG | Discrete Mathematics | |||
1999 | Characterizing bit permutation networks | GERARD JENNHWA CHANG | Networks | |||
1998 | Circular chromatic numbers and fractional chromatic numbers of distance graphs | GERARD JENNHWA CHANG | European Journal of Combinatorics | |||
2000 | Circular Chromatic Numbers of Distance Graphs with Distance Sets Missing Multiples | GERARD JENNHWA CHANG | European Journal of Combinatorics | |||
1999 | Circular chromatic numbers of Mycielski's graphs | GERARD JENNHWA CHANG | Discrete Mathematics | |||
2008 | Clique coverings and partitions of line graphs | Li, B.J.; GERARD JENNHWA CHANG ; Chang, G.J. | Discrete Mathematics | 3 | 3 | |
2012 | Competition numbers of complete r-partite graphs | GERARD JENNHWA CHANG | Discrete Applied Mathematics | 8 | 7 | |
2012 | Complexity of distance paired-domination problem in graphs | GERARD JENNHWA CHANG | Theoretical Computer Science | 6 | 5 | |
2011 | Consecutive edge-colorings of generalized θ-graphs | GERARD JENNHWA CHANG | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 1 | 0 | |
1997 | Cordial labeling of mKn | GERARD JENNHWA CHANG | Discrete Mathematics | |||
2014 | Counterexamples to an edge spread question for zero forcing number | GERARD JENNHWA CHANG | Linear Algebra and Its Applications | 0 | 0 | |
2005 | Diagnosabilities of Regular Networks. | Chang, Guey-Yun; Chang, Gerard J.; GEN-HUEY CHEN ; GERARD JENNHWA CHANG | IEEE Trans. Parallel Distrib. Syst. | 99 | 89 |