1. 首頁
  2. 教師簡介_顏經和 老師

教師簡介_顏經和 老師

Link to 教師基本介紹_顏經和 老師
Link to 研究產出&著作_顏經和 老師

研究產出&著作_顏經和 老師

 

期刊論文

  1. J.H. Yan and G.J. Chang, 1994. "The path-partition problem in block graphs, " Information Processing Letters, vol.52, pp.317-322. NSC83-0208-M009-050 (SCI expanded )
  2. M.S. Chang, Y.H. Chen, G.J. Chang, and J.H. Yan, 1996, "Algorithmic aspects of the generalized clique-transversal problem on chordal graphs," Discrete Applied Mathematics, vol.66, pp.189-203. NSC-81-0208-M-009-050 (SCI )
  3. J.H. Yan, J.J. Chen, and G.J. Chang, 1996, "Quasi-threshold graphs," Discrete Applied Mathematics, vol.69, pp.247-255. NSC-81-0208-M009-26 (SCI)
  4. J.H. Yan, G.J. Chang, S.M. Hedetniemi and S.T. Hedetniemi, 1997. "k-Path partitions in tress," Discrete Applied Mathematics, vol.78, pp. 227-233. NSC83-0208-M-009-050 (SCI)
  5. J.H. Yan, K.W. Lih, D. Kuo, and G.J. Chang, 1997. "Signed degree sequences of signed graphs," J. Graph Theory, vol.26, pp.111-117. NSC85-2121-M001-026 (SCI )
  6. J.H. Yan, 1997. "The bandwidth problem in cographs," Tamsui Oxford Journal of Mathematical Sciences, vol.13, pp. 31-36. NSC87-2115-M156-001
  7. J.H. Yan, 1998. "Algorithm Aspects of the bandwidth problem on P4-sparse graphs," Tamsui Oxford Journal of Mathematical Sciences, vol.14, pp. 11-18. NSC87-2115-M156-001
  8. K.W. Lih, L.D. Tong, and J.H. Yan, 2001,03. "On cycle sequences," Graph and Combinatorics, vol. 17, pp.129-133. NSC85-2121-M001-026 (SCI expanded)
  9. G.J. Chang, L.D. Tong, J.H. Yan, and H.G. Yeh, 2002. "A Note on Gallai-Roy-Vitaver Theorem," Discrete Mathematics, vol. 256, no.1-2, pp. 441-444. NSC87-2115-M156-001 (SCI)
  10. D. Kuo and J.H. Yan, 2004. "On L(2,1)-labeling for the Cartesian product with cycles and paths," Discrete Mathematics, vol 283, pp, 137-144. NSC88-2115-M156-002 (SCI)
  11. M.J. Chen, D. Kuo, and J.H. Yan, 2005. "The bandwidth sum of join and composition of graphs," Discrete Mathematics, vol 290, pp, 145-163. NSC89-2115-M156-008 (SCI) 
  12. C.J. Wu, Y.W. Chen, J.H. Yan, and Y.L. Wang, 2007,09"Seamless Channel Transition for Slotted Generalized Fibonacci Broadcasting," MULTIMEDIA SYSTEMS,vol.13, 223-233. (SCI)
  13. Y.D. Chen and J.H. Yan, 2007,10. "A study on cyclic bandwidth sum," Journal of Combinatorial Optimization, vol 14, 295-308. NSC91-2115-M156-001(SCI expanded)
  14. D. Kuo and J.H. Yan, 2008,10. " The profile of the Cartesian product of graphs," Discrete Applied Mathematics, vol 156, 2835-2845. NSC89-2115-M156-004 (SCI) 
  15. S.H. Chiang and J.H. Yan, 2008,10. "On L(d,1)-labeling of Cartesian product of a cycle and a path," Discrete Applied Mathematics, vol 156, 2867-2881. NSC92-2115-M156-001 
  16. C.N. Chang and J.H. Yan, 2009,11. "D-Graceful labeling of a path," Tamsui Oxford Journal of Mathematical Sciences. vol.25, no 4, pp. 415-423. NSC90-2115-M156-001
  17. M.L. Chia, D. Kuo, J.Y. Lin, J.H. Yan, and S. R. Yang 2013,05. “(p,q)-total labeling of complete graphs,” Journal of Combinatorial Optimization. Vol.25, no 4, pp. 543-561. NSC94-2115-M-156-001
  18. B G. J. Chang, M.L. Chia, D. Kuo, J.Y. Lin, and J.H. Yan, 2014,05. “Bandwidth sums of block graphs and cacti,” Journal of Combinatorial Optimization. Vol.27, no 4, pp. 679-687  NSC94-2115-M-156-001
  19. Chan-Wei Chang, David Kuo, Sheng-Chyang Liaw, and J.H. Yan, 2014,08. “F3-domination problem of graphs,” Journal of Combinatorial Optimization. Vol 28, no 2, 400-413.  NSC99-2115-M-156-003
  20. C.C. Lin and J.H. Yan, 2015,07. "On L(d,1)-labeling of Cartesian product of two cycles," Ars Combinatoria Vol. 122, 33-53.  NSC95-2115-M156-002 
瀏覽數:

師資介紹

顏經和 教授
林顯仁 教授
王信忠 教授
蔡溥仁 副教授
彭成煌 助理教授
李中傑 助理教授
鐘譽偉 助理教授