全文获取类型
收费全文 | 159篇 |
免费 | 4篇 |
国内免费 | 8篇 |
专业分类
化学 | 7篇 |
数学 | 156篇 |
物理学 | 8篇 |
出版年
2023年 | 1篇 |
2022年 | 1篇 |
2021年 | 4篇 |
2020年 | 3篇 |
2019年 | 3篇 |
2018年 | 2篇 |
2017年 | 1篇 |
2016年 | 1篇 |
2015年 | 2篇 |
2014年 | 4篇 |
2013年 | 30篇 |
2012年 | 2篇 |
2011年 | 11篇 |
2010年 | 9篇 |
2009年 | 11篇 |
2008年 | 11篇 |
2007年 | 4篇 |
2006年 | 9篇 |
2005年 | 4篇 |
2004年 | 9篇 |
2003年 | 6篇 |
2002年 | 5篇 |
2001年 | 2篇 |
2000年 | 2篇 |
1999年 | 5篇 |
1998年 | 1篇 |
1997年 | 2篇 |
1995年 | 1篇 |
1994年 | 2篇 |
1993年 | 4篇 |
1988年 | 1篇 |
1985年 | 4篇 |
1984年 | 3篇 |
1983年 | 1篇 |
1982年 | 3篇 |
1981年 | 1篇 |
1979年 | 5篇 |
1977年 | 1篇 |
排序方式: 共有171条查询结果,搜索用时 15 毫秒
1.
In the core of the seminal Graph Minor Theory of Robertson and Seymour lies a powerful theorem capturing the ``rough' structure
of graphs excluding a fixed minor. This result was used to prove Wagner's Conjecture that finite graphs are well-quasi-ordered
under the graph minor relation. Recently, a number of beautiful results that use this structural result have appeared. Some
of these along with some other recent advances on graph minors are surveyed.
Research partly supported by Japan Society for the Promotion of Science, Grant-in-Aid for Scientific Research, Grant number
16740044, by Sumitomo Foundation, by C & C Foundation and by Inoue Research Award for Young Scientists
Supported in part by the Research Grant P1–0297 and by the CRC program
On leave from: IMFM & FMF, Department of Mathematics, University of Ljubljana, Ljubljana, Slovenia 相似文献
2.
Lars Eirik Danielsen 《Journal of Combinatorial Theory, Series A》2006,113(7):1351-1367
We consider additive codes over GF(4) that are self-dual with respect to the Hermitian trace inner product. Such codes have a well-known interpretation as quantum codes and correspond to isotropic systems. It has also been shown that these codes can be represented as graphs, and that two codes are equivalent if and only if the corresponding graphs are equivalent with respect to local complementation and graph isomorphism. We use these facts to classify all codes of length up to 12, where previously only all codes of length up to 9 were known. We also classify all extremal Type II codes of length 14. Finally, we find that the smallest Type I and Type II codes with trivial automorphism group have length 9 and 12, respectively. 相似文献
3.
Alice Devillers Michael Giudici Cai Heng Li Cheryl E. Praeger 《Journal of Combinatorial Theory, Series A》2013,120(7):1855-1870
The study of locally s-distance transitive graphs initiated by the authors in previous work, identified that graphs with a star quotient are of particular interest. This paper shows that the study of locally s-distance transitive graphs with a star quotient is equivalent to the study of a particular family of designs with strong symmetry properties that we call nicely affine and pairwise transitive. We show that a group acting regularly on the points of such a design must be abelian and give general construction for this case. 相似文献
4.
5.
Lucia Gionfriddo 《Discrete Mathematics》2010,310(22):3067-620
A dodecagon quadrangle is the graph consisting of two cycles: a 12-cycle (x1,x2,…,x12) and a 4-cycle (x1,x4,x7,x10). A dodecagon quadrangle system of order n and index ρ [ DQS] is a pair (X,H), where X is a finite set of n vertices and H is a collection of edge disjoint dodecagon quadrangles (called blocks) which partitions the edge set of ρKn, with vertex set X. A dodecagon quadrangle system of order n is said to be perfect [PDQS] if the collection of 4-cycles contained in the dodecagon quadrangles form a 4-cycle system of order n and index μ. In this paper we determine completely the spectrum of DQSs of index one and of PDQSs with the inside 4-cycle system of index one. 相似文献
6.
Our model is a generalized linear programming relaxation of a much studied random K-SAT problem. Specifically, a set of linear constraints on K variables is fixed. From a pool of n variables, K variables are chosen uniformly at random and a constraint is chosen from also uniformly at random. This procedure is repeated m times independently. We are interested in whether the resulting linear programming problem is feasible. We prove that the feasibility property experiences a linear phase transition, when n and m = cn for a constant c. Namely, there exists a critical value c* such that, when c < c*, the problem is feasible or is asymptotically almost feasible, as n, but, when c>c*, the distance to feasibility is at least a positive constant independent of n. Our result is obtained using the combination of a powerful local weak convergence method developed in Aldous [Ald92], [Ald01], Aldous and Steele [AS03], Steele [Ste02] and martingale techniques. By exploiting a linear programming duality, our theorem implies the following result in the context of sparse random graphs G(n, cn) on n nodes with cn edges, where edges are equipped with randomly generated weights. Let (n, c) denote maximum weight matching in G(n, cn). We prove that when c is a constant and n , the limit limn (n, c)/n, exists, with high probability. We further extend this result to maximum weight b-matchings also in G(n, cn). 相似文献
7.
Christos Tatakis Apostolos Thoma 《Journal of Combinatorial Theory, Series A》2011,118(5):1540-1548
The universal Gröbner basis of an ideal is a Gröbner basis with respect to all term orders simultaneously. We characterize in graph theoretical terms the elements of the universal Gröbner basis of the toric ideal of a graph. We also provide a new degree bound. Finally, we give examples of graphs for which the true degrees of their circuits are less than the degrees of some elements of the Graver basis. 相似文献
8.
Total Domination in Graphs with Given Girth 总被引:1,自引:0,他引:1
A set S of vertices in a graph G without isolated vertices is a total dominating set of G if every vertex of G is adjacent to some vertex in S. The minimum cardinality of a total dominating set of G is the total domination number γ
t
(G) of G. In this paper, we establish an upper bound on the total domination number of a graph with minimum degree at least two in
terms of its order and girth. We prove that if G is a graph of order n with minimum degree at least two and girth g, then γ
t
(G) ≤ n/2 + n/g, and this bound is sharp. Our proof is an interplay between graph theory and transversals in hypergraphs.
Michael A. Henning: Research supported in part by the South African National Research Foundation and the University of KwaZulu-Natal. 相似文献
9.
10.