2012年接��表论文33篇

1. é™ˆæ°¸å·�,桑冬鸣,施亚辉

An overpartition analogue of Bressoud's theorem of Rogers-Ramanujan-Gordon type

Ramanujan J.
2. æ�œåº·ï¼Œä¾¯åº†è™Ž

Partially ordinal sums and P-partitions

Electron. J. Combin. 19(4) (2012) #P29
3. é™ˆæ°¸å·�,任晓艳,æ�¨ç«‹æ³¢

Proof of a positivity conjecture on Schur functions

J. Combin. Theory Ser. A
4. æ�Žé›ªç�Šï¼Œç¼ªé“¶å‡¤

Invariant principal order ideals under Foata's transformation

Electron. J. Combin. 19(4) (2012) #P3
5. é™ˆæ°¸å·�,A.J. Yee,朱佳文

Euler's partition theorem with upper bounds on multiplicities

Electron. J. Combin. 19(3) (2012) #P41
6. é™ˆæ°¸å·�,龚泽,郭剑锋

The sorting index and permutation codes

Adv. in Appl. Math.
7. é™ˆæ°¸å·�,桑冬鸣,施亚辉

The Rogers-Ramanujan-Gordon theorem for overpartitions

Proc. London Math. Soc. (3) 106(6) (2013) 1371-1393
8. é™ˆæ°¸å·�,窦全æ�°ï¼Œæ�¨ç«‹æ³¢

Branden's conjectures on the Boros-Moll polynomials

Internat. Math. Res. Notices
9. é™ˆæ°¸å·�,å¤�先伟

2-Log-concavity of the Boros-Moll polynomials

Proc. Edinb. Math. Soc.
10. é™ˆæ°¸å·�,高星强,郭龙

q-hook length formulas for signed labeled forests

Adv. Appl. Math. 51(5) (2013) 563--582
11. é™ˆæ°¸å·�,王å�¥

Noncrossing linked partitions and large (3, 2)-Motzkin paths

Discrete Math.
12. C.H. Li,路在平,王改霞

Vertex-transitive cubic graphs of square-free order

J. Graph Theory
13. C.H. Li,Z. Liu,路在平

The edge-transitive tetravalent Cayley graphs of square-free order

Discrete Math.
14. éŸ©å�Žï¼Œè·¯åœ¨å¹³

Semisymmetric graphs of order 6p^2 and prime valency

Sci. China Ser. A
15. æ�Žå­¦è‰¯ï¼Œæ�Žä¸€é˜³ï¼Œå�²æ°¸å ‚,I. Gutman

Note on the HOMO-LUMO index of graphs

MATCH Commun. Math. Comput. Chem.
16. æ�Žå­¦è‰¯ï¼Œæ¯›äºšå¹³ï¼Œå�²æ°¸å ‚

The strong rainbow vertex-connection of graphs

Utilitas Math.
17. æ�Žæ�’哲,æ�Žå­¦è‰¯ï¼Œå­™è·ƒæ–¹ï¼Œèµµç‡•

Note on minimally d-rainbow connected graphs

Graphs Combin.
18. æ�Žå­¦è‰¯ï¼Œå�²æ°¸å ‚,孙跃方

Rainbow connections of graphs – A survey

Graphs Combin.
19. è‘£ä¹�英,æ�Žå­¦è‰¯

Rainbow connection numbers and the minimum degree sum of a graph

Sci. China Ser. A
20. æ�Žå­¦è‰¯ï¼Œåˆ˜è’™è’™ï¼ŒI. Schiermeyer

Rainbow connection number of dense graphs

Discuss. Math. Graph Theory
21. è‘£ä¹�英,æ�Žå­¦è‰¯

Rainbow connection number, bridges and radius

Graphs Combin.
22. æ�Žå­¦è‰¯ï¼Œå�²æ°¸å ‚

Rainbow connection in 3-connected graphs

Graphs Combin.
23. é™ˆèŽ‰èŽ‰ï¼Œæ�Žå­¦è‰¯ï¼Œè¿žä¼šä¹¦

Nordhaus-Gaddum-type theorem for rainbow connection number of graphs

Graphs Combin.
24. æ�Žå­¦è‰¯ï¼Œå�²æ°¸å ‚,L.S. Wang

On a relation between Randic index and algebraic connectivity

MATCH Commun. Math. Comput. Chem.
25. æ�Žå­¦è‰¯ï¼Œå�²æ°¸å ‚

On the rainbow vertex-connection

Discuss. Math. Graph Theory
26. æ�Žæ�’哲,æ�Žå­¦è‰¯ï¼Œå­™è·ƒæ–¹

The generalized 3-connectivity of Cartesian product graphs

Discrete Math. Theor. Comput. Sci.
27. Z.M. Jin,æ�Žå­¦è‰¯

Partitioning complete graphs by heterochromatic trees

Acta Math. Appl. Sin.
28. æ�Žå­¦è‰¯ï¼Œåˆ˜ç´ å¨Ÿ

Rainbow connection number and connectivity

Electron. J. Combin. 19 (2012), #P20
29. æ�Žæ�’哲,æ�Žå­¦è‰¯ï¼Œåˆ˜ç´ å¨Ÿ

Rainbow connection of graphs with diameter 2

Discrete Math.
30. M.N. Chintamani,B.K. Moriya,高维东,P. Paul,R. Thangadurai

New upper bounds for the Davenport and for the Erdos–Ginzburg–Ziv constants

Arch. Math. (Basel) 98(2) (2012) 133–142
31. é«˜ç»´ä¸œï¼ŒçŽ‹æž—æž—

On the maximal cross number of unique factorization zero-sum sequences over a finite abelian group

Integers
32. èŒƒçމå�Œï¼Œé«˜ç»´ä¸œï¼ŒçŽ‹å›½åº†ï¼Œé’Ÿåº†æµ·ï¼Œåº„ä¸¾å¨Ÿ

On short zero-sum subsequences of zero-sum sequences

European J. Combin.
33. èŒƒçމå�Œï¼Œé«˜ç»´ä¸œï¼ŒçŽ‹æž—æž—ï¼Œé’Ÿåº†æµ·

Two zero-sum invariants on finite abelian groups

European J. Combin.