2002年接��表论文17篇
| 1. | å¼ å®�å�° | |
| A new elementary algorithm for proving q-hypergeometric identities | ||
| J. Symbolic Comput. 35 (2003), No.3, 293--303 | ||
| 2. | 王超 | |
| Note on a variant of the Erd�os-Ginzburg-Ziv problem | ||
| Acta Arith. 108 (2003), No.1, 53--59 | ||
| 3. | 付梅，Alain Lascoux | |
| q-Identities from Lagrange and Newton interpolation | ||
| Adv. in Appl. Math. 31 (2003), No.3, 527--531 | ||
| 4. | 侯庆虎，穆彦平 | |
| Recurrent Sequences and Schur Functions | ||
| Adv. in Appl. Math. 31 (2003), No.1, 150--162 | ||
| 5. | 陈永�，�冰清，J.D. Louck | |
| The Flagged Double Schur Function | ||
| J. Algebraic Combin. 15 (2002), No.1, 7--26 | ||
| 6. | éƒå†›ä¼Ÿ | |
| A simple proof of Dixon’s identity | ||
| Discrete Math. 268 (2003), No.1-3, 309--310 | ||
| 7. | éƒå†›ä¼Ÿ | |
| A blossoming algorithm for tree volumes of composite digraphs | ||
| Adv. in Appl. Math. 31 (2003), No.2, 321--333 | ||
| 8. | 陈永�，付梅 | |
| Cauchy augmentation for basic hypergeometric series | ||
| Bull. London Math. Soc. 36 (2004), No.2, 169--175 | ||
| 9. | 陈永å·�ï¼Œä»˜æ¢…ï¼Œå¼ å®�å�° | |
| The homogeneous q-difference operator | ||
| Adv. in Appl. Math. 31 (2003), No.4, 659--668 | ||
| 10. | 陈永�，侯庆虎，Alain Lascoux | |
| An Involution for the Gauss Identity | ||
| J. Combin. Theory Ser. A 102 (2003), No.2, 309--320 | ||
| 11. | æ�Žå¦è‰¯ï¼ŒH. Sun，S.G. Zhang | |
| w-density and w-balanced property of weighted graphs | ||
| Appl. Math. J. Chinese Univ. Ser. B 17 (2002), No.3, 355--364 | ||
| 12. | æ�Žå¦è‰¯ï¼ŒL.S. Wang，H.X. Zhao | |
| A complete solution to a conjecture on the $beta$-polynomials of graphs | ||
| J. Math. Chem. 33 (2003), No.3-4, 189--193 | ||
| 13. | æ�Žå¦è‰¯ï¼ŒV. Neumann-Lara，E. Riversa-Campo | |
| Two approaches for the generalization of leaf edge exchange graphs on spanning trees to connected spanning k-edge subgraphs of a graph | ||
| Ars Combin. 75 (2005) | ||
| 14. | H. Broersma，æ�Žå¦è‰¯ | |
| Isomorphisms and traversability of directed path graphs | ||
| Discuss. Math. Graph Theory 22 (2002), 215--228 | ||
| 15. | æ�Žå¦è‰¯ï¼ŒV. Neumann-Lara，E. Riversa-Campo | |
| On a tree graph defined by a set of cycles | ||
| Discrete Math. 271 (2003), No.1-3, 303--310 | ||
| 16. | 陈彩云，�治国 | |
| 基于é�—ä¼ ç®—æ³•çš„æ‰‹æœºé”®ç›˜å—æ¯�å¸ƒå±€çš„ç ”ç©¶ | ||
| 计算机工程与应用 (2003), No.27, 77--79 | ||
| 17. | 陈彩云，�治国 | |
| 一�基于 SVD 和 Rough 集的信�过滤方法 | ||
| 计算机工程与应用 (2003), No.34, 99--101 | ||
