Browsing by Author Chang, GJ

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
or enter first few letters:  
Showing results 1 to 20 of 72  next >
Issue DateTitleAuthor(s)
1-Sep-2002Algorithmic aspect of k-tuple domination in graphsLiao, CS; Chang, GJ; 應用數學系; Department of Applied Mathematics
1-Oct-2002Algorithmic aspects of counting independent setsJou, MJ; Chang, GJ; 應用數學系; Department of Applied Mathematics
1-Mar-1999Algorithmic aspects of linear k-arboricityChang, GJ; 應用數學系; Department of Applied Mathematics
20-May-1996Algorithmic aspects of the generalized clique-transversal problem on chordal graphsChang, MS; Chen, YH; Chang, GJ; Yan, JH; 應用數學系; Department of Applied Mathematics
20-May-1996Algorithmic aspects of the generalized clique-transversal problem on chordal graphsChang, MS; Chen, YH; Chang, GJ; Yan, JH; 應用數學系; Department of Applied Mathematics
1-Aug-1997The beta-assignment problem in general graphsChang, GJ; Ho, PH; 應用數學系; Department of Applied Mathematics
1-Feb-1998The beta-assignment problemsChang, GJ; Ho, PH; 應用數學系; Department of Applied Mathematics
1-Sep-1999Bipartite Steinhaus graphsLee, YS; Chang, GJ; 應用數學系; Department of Applied Mathematics
28-Jul-2001Channel graphs of bit permutation networksTong, LD; Wang, FK; Chang, GJ; 應用數學系; Department of Applied Mathematics
28-Mar-1999Characterizations of bipartite Steinhaus graphsChang, GJ; DasGupta, B; Dymacek, WM; Furer, M; Koerlin, M; Lee, YS; Whaley, T; 應用數學系; Department of Applied Mathematics
1998Characterizing bit permutation networksChang, GJ; Hwang, FK; Tong, LD; 應用數學系; Department of Applied Mathematics
1-Jul-1999Characterizing bit permutation networksChang, GJ; Hwang, FK; Tong, LD; 應用數學系; Department of Applied Mathematics
1-Sep-1999The circular chromatic number of the Mycielskian of G(k)(d)Huang, LL; Chang, GJ; 應用數學系; Department of Applied Mathematics
1-May-1998Circular chromatic numbers and fractional chromatic numbers of distance graphsChang, GJ; Huang, LL; Zhu, XD; 應用數學系; Department of Applied Mathematics
1-Feb-2000Circular chromatic numbers of distance graphs with distance sets missing multiplesHuang, LL; Chang, GJ; 應用數學系; Department of Applied Mathematics
28-Jul-1999Circular chromatic numbers of Mycielski's graphsChang, GJ; Huang, LL; Zhu, XD; 應用數學系; Department of Applied Mathematics
1-May-1999The consecutive-4 digraphs are HamiltonianChang, GJ; Hwang, FK; Tong, LD; 應用數學系; Department of Applied Mathematics
15-May-1997Cordial labeling of mK(n)Kuo, D; Chang, GJ; Kwong, YHH; 應用數學系; Department of Applied Mathematics
1-Mar-1999Distance graphs and T-coloringChang, GJ; Liu, DDF; Zhu, XD; 應用數學系; Department of Applied Mathematics
15-Jan-2002Domination in distance-hereditary graphsChang, MS; Wu, SC; Chang, GJ; Yeh, HG; 應用數學系; Department of Applied Mathematics