全文获取类型
收费全文 | 95篇 |
免费 | 19篇 |
国内免费 | 25篇 |
专业分类
化学 | 1篇 |
综合类 | 1篇 |
数学 | 133篇 |
物理学 | 4篇 |
出版年
2023年 | 2篇 |
2022年 | 1篇 |
2021年 | 2篇 |
2020年 | 3篇 |
2019年 | 4篇 |
2018年 | 6篇 |
2017年 | 6篇 |
2016年 | 6篇 |
2015年 | 3篇 |
2014年 | 7篇 |
2013年 | 10篇 |
2012年 | 2篇 |
2011年 | 5篇 |
2010年 | 7篇 |
2009年 | 2篇 |
2008年 | 7篇 |
2007年 | 5篇 |
2006年 | 4篇 |
2005年 | 6篇 |
2004年 | 3篇 |
2003年 | 6篇 |
2002年 | 8篇 |
2001年 | 6篇 |
2000年 | 4篇 |
1999年 | 6篇 |
1998年 | 7篇 |
1997年 | 4篇 |
1996年 | 3篇 |
1995年 | 1篇 |
1994年 | 1篇 |
1986年 | 1篇 |
1985年 | 1篇 |
排序方式: 共有139条查询结果,搜索用时 15 毫秒
1.
In this note we show how coverings induced by voltage assignments can be used to produce packings of disjoint copies of the Hoffman‐Singleton graph into K50. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 408–412, 2003; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10049 相似文献
2.
有限群表示的一个结论 总被引:1,自引:0,他引:1
张玉成 《数学的实践与认识》2004,34(3):116-119
利用陪集、重陪集等概念和性质 ,证明了一个利用有限群 G的子集表示 G的结论 . 相似文献
3.
New constructions of regular disjoint distinct difference sets (DDDS) are presented. In particular, multiplicative and additive DDDS are considered. 相似文献
4.
Thomas Andreae 《Journal of Graph Theory》2002,39(4):222-229
For a graph A and a positive integer n, let nA denote the union of n disjoint copies of A; similarly, the union of ?0 disjoint copies of A is referred to as ?0A. It is shown that there exist (connected) graphs A and G such that nA is a minor of G for all n??, but ?0A is not a minor of G. This supplements previous examples showing that analogous statements are true if, instead of minors, isomorphic embeddings or topological minors are considered. The construction of A and G is based on the fact that there exist (infinite) graphs G1, G2,… such that Gi is not a minor of Gj for all i ≠ j. In contrast to previous examples concerning isomorphic embeddings and topological minors, the graphs A and G presented here are not locally finite. The following conjecture is suggested: for each locally finite connected graph A and each graph G, if nA is a minor of G for all n ? ?, then ?0A is a minor of G, too. If true, this would be a far‐reaching generalization of a classical result of R. Halin on families of disjoint one‐way infinite paths in graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 39: 222–229, 2002; DOI 10.1002/jgt.10016 相似文献
5.
We present anO(p · n) algorithm for the problem of finding disjoint simple paths of minimum total length betweenp given pairs of terminals on oriented partial 2-trees withn nodes and positive or negative arc lengths. The algorithm is inO(n) if all terminals are distinct nodes. We characterize the convex hull of the feasible solution set for the casep=2.We gratefully acknowledge the referee's many helpful suggestions to improve the presentation of this paper. 相似文献
6.
7.
8.
Ya'akov Nahir 《International Journal of Mathematical Education in Science & Technology》2013,44(4):614-624
A procedure is presented by which the integration of a function such as cos n (x) or sin n (x) with n = 1, 2, 3, 4 … is facilitated. 相似文献
9.
Paul J. Szeptycki 《Proceedings of the American Mathematical Society》2002,130(12):3713-3717
An almost disjoint family is said to be soft if there is an infinite set that meets each in a nonempty but finite set. We consider the associated cardinal invariant defined to be the minimal cardinality of an almost disjoint family that is not soft. We show that this cardinal coincides with J. Brendle's cardinal .
10.
Some previous results of the author towards a classification of homogeneous metric continua are improved. The disjoint arcs property is fully revealed in this context. In particular, closed -manifolds, , are characterized as those homogeneous continua which do not have the disjoint arcs property.