2006年接��表论文51篇

1. R.-H. Li,æ�Žå­¦è‰¯ï¼ŒZ.-B. Xu

Linear quantum codes of minimum distance three

Int. J. Quantum Info.
2. R. Li,æ�Žå­¦è‰¯

Binary construction of quantum codes of minimum distances five and six

Discrete Math.
3. é™ˆæ°¸å·�,Toufik Mansour,严慧芳

Matchings avoiding partial patterns

Electron. J. Combin. 13 (2006) R112
4. V. Jelinek,æ�Žå²©ï¼ŒToufik Mansour,严慧芳

Matchings avoiding partial patterns and lattice paths

Electron. J. Combin. 13(1) (2006) R89
5. é™ˆæ°¸å·�,季é�’,H. Wilf

BG-ranks and 2-cores

Electron. J. Combin. 13(1) (2006) N18
6. ä»˜æ¢…,A. Lascoux

A question of Muir and Littlewood's products

Linear Algebra Appl. 420 (2007) 508-516
7. é™ˆæ°¸å·�,严慧芳

Noncrossing trees and noncrossing graphs

Electron. J. Combin. 13 (2006) N12
8. é™ˆæ°¸å…µï¼Œé™ˆæ°¸å·�,谷ç�Šç�Š

The Abel lemma and the q-Gosper algorithm

Math. Comp. 77 (2008), 1057-1074
9. åˆ˜ä¹�强

Asymptotic existence theorems for frames and group divisible designs

J. Combin. Theory Ser. A
10. èƒ¡æ¯…

Quotients by reductive group,Borel subgroup,unipotent group and maximal torus

Q. J. Pure Appl. Math.
11. é™ˆæ°¸å·�,季é�’

Weighted forms of Euler's theorem

J. Combin. Theory Ser. A 114 (2007) 360--372
12. é™ˆæ°¸å·�,æ�¨ç«‹æ³¢

Stanley's zrank conjecture on skew partitions

Trans. Amer. Math. Soc. 360 (2008) 3121–3131
13. é™ˆæ°¸å·�,æ�Žå²©ï¼ŒL.W. Shapiro,严慧芳

Matrix identities on weighted partial Motzkin paths

European J. Combin. 28 (4) (2007)
14. é™ˆæ°¸å·�,侯庆虎

Factors of the gaussian coefficients

Discrete Math. 306 (2006), 1446--1449
15. Toufik Mansour

Statistics on Dyck paths

J. Integer Seq. 9 (1) (2006) Article 06.1.5 (13pp.)
16. Toufik Mansour

Restricted 132-avoiding k-ary words,Chebyshev polynomials,and continued fractions

Adv. in Appl. Math. 36 (2) (2006), 175--193
17. Toufik Mansour

The enumeration of permutations whose posets have a maximal element

Adv. in Appl. Math. 37(4) (2006), 434--442
18. Toufik Mansour,严慧芳,æ�¨ä¸½æ•�

Counting occurrences of 231 in an involution

Discrete Math. 306(6) (2006), 564--572
19. Toufik Mansour,邓玉平,æ�œè‹¥éœž

Dyck paths and restricted permutations

Discrete Appl. Math. 154 (2006), 1593--1605
20. èƒ¡æ¯…

Geometric invariant theory and birational geometry

Proceedings of ICCM-2004
21. å·¦è¿žç¿ ï¼ŒJ.-L. Wu,J.-Z. Liu

The fractional vertex linear arboricity of graphs

Ars Combin. 81 (2006), 175--191
22. G.-T. Chen,Z.-C. Gao, éƒ�星星,W.-A. Zang

Approximating longest cycles in graphs with bounded degrees

SIAM J. Comput. 36 (2006), No.3, 635--656
23. éƒ�星星

Infinite paths in planar graphs IV,dividing cycles

J. Graph Theory
24. S. Curran,O. Lee,éƒ�星星

Finding four independent trees

SIAM J. Comput. 35(5) (2006) 1023--1058
25. è·¯åœ¨å¹³ï¼ŒS.-M. Zhou

Finite symmetric graphs with two-arc transitive quotients (II)

J. Graph Theory
26. å·¦è¿žç¿ ï¼Œå�´å»ºè‰¯ï¼Œåˆ˜å®¶å£®

整数�离图G(D_{m,k,2})的点线性�度

系统科学与数学 26(5) (2006) 522--532
27. å·¦è¿žç¿ ï¼ŒJ.-L. Wu,J.-Z. Liu

The vertex linear arboricity of distance graphs

Discrete Math. 306 (2006), 284--289
28. å·¦è¿žç¿ ï¼ŒäºŽé�’林,J.-L. Wu

Tree coloring of distance graphs with a real interval set

Appl. Math. Lett. 19(12) (2006), 1341-1344
29. G.-Z. Liu,于é�’æž—

On (n,k)-extendable graphs and induced subgraphs

International Mathematical Forum 2(23) (2007) 1141--1148
30. èƒ¡çŽ‰æ¢…ï¼Œæ�Žå­¦è‰¯ï¼Œå�²æ°¸å ‚,许天怿

Connected (n,m)-graphs with minimum and maximum zeroth-order general Randic index

Discrete Appl. Math.
31. èƒ¡ç�³ï¼Œæ�Žå­¦è‰¯

Sufficient conditions for the existence of perfect heterochromatic matchings in colored ___graphs

Proceedings of CJCDGCGT 2005, Lecture Notes in Computer Science, Springer, Dec. 2006
32. æ›²æ™“英,H.-Y. Lin

Quasilocally connected,almost locally connected or triangularly connected claw-free ___graphs

Proceedings of CJCDGCGT 2005,Lecture Notes in Computer Science,Springer,Dec. 2006
33. G.-J. Xu,æ�Žå­¦è‰¯ï¼ŒS.-G. Zhang

The binding number of a digraph

Proceedings of CJCDGCGT 2005, Lecture Notes in Computer Science, Springer, Dec. 2006
34. Y.-H. Ma,于é�’æž—

Isolated toughness and existence of f-factors

Proceedings of CJCDGCGT 2005, Lecture Notes in Computer Science, Springer, Dec. 2006
35. äºŽé�’林,左连翠

Fractional vertex arboricity of graphs

Proceedings of CJCDGCGT 2005, Lecture Notes in Computer Science, Springer, Dec. 2006
36. é©¬è‹±çº¢ï¼ŒäºŽé�’æž—

On existence of [a,b]-factors avoiding given subgraphs

Ars Combin.
37. é‡‘泽民,严慧芳,于é�’æž—

Generalization of matching extensions in graphs (II)

Discrete Appl. Math.
38. D. Bauer,Hajo Broersma,E. Schmeichel

Toughness in graphs -- a survey

Graphs Combin. 22 (2006) 1--35
39. B.-G. Xu,于é�’æž—

A note on (3,1)_-choosable toroidal graphs

Util. Math. 76(2008),183-189
40. æ�Žå­¦è‰¯ï¼Œå�²æ°¸å ‚,许天怿

Unicyclic graphs with maximum general Randic index for alpha_0

MATCH Commun. Math. Comput. Chem. 56 (2006), No.3., 557--570
41. G.-T. Chen,L. Sheppardson,éƒ�星星,W.-A. Zang

The circumference of a graph with no $K_{3,t}$-minor

J. Combin. Theory Ser. B 96 (2006), 822--845
42. éƒ�星星,F. Zickfeld

Reducing Hajós'4-coloring conjecture to 4-connected graphs

J. Combin. Theory Ser. B 96(4) (2006), 482--292
43. æ�Žå­¦è‰¯ï¼Œå¼ å»ºæ–Œï¼ŒB. Zhou

The spread of unicyclic graphs with given size of maximum matchings

J. Math. Chem.
44. æ�Žå­¦è‰¯ï¼Œå¼ å»ºæ–Œï¼ŒB. Zhou

On unicyclic conjugated molecules with minimal energies

J. Math. Chem.
45. æ�Žå­¦è‰¯ï¼ŒZ. Zhang

A characterization of the existence of even factors

Graphs Combin.
46. Z.M. Jin,M. Kano,æ�Žå­¦è‰¯ï¼ŒB. Wei

Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles,paths ___and trees

J. Comb. Optim. 11(4) (2006), 445--454
47. Z.M. Jin,æ�Žå­¦è‰¯

On the k-path cover problem for cacti

Theoret. Comput. Sci. 355 (2006), No.3, 354--363
48. æ�Žæ‰�æ�’,路在平,P.P. Pálfy

Further restrictions on the structure of finite CI-groups

J. Algebraic Combin.
49. é»„å°�龙,金泽民,éƒ�星星,张晓岩

Contractible cliques in k-connected graphs

Graphs Combin. 22(3) (2006), 361--370
50. H. Li,æ�Žå­¦è‰¯ï¼ŒG.-Z. Liu,G.-H. Wang

The heterochromatic matchings in edge-colored bipartite graphs

Ars Combin.
51. é«˜ç»´ä¸œï¼ŒA. Geroldinger

Zero-sum problems in finite abelian groups_a survey

Expo. Math. 24(4) (2006), 337--369