全文获取类型
收费全文 | 157篇 |
免费 | 3篇 |
国内免费 | 6篇 |
专业分类
综合类 | 2篇 |
数学 | 158篇 |
物理学 | 6篇 |
出版年
2023年 | 2篇 |
2022年 | 6篇 |
2021年 | 5篇 |
2020年 | 8篇 |
2019年 | 8篇 |
2018年 | 9篇 |
2017年 | 1篇 |
2015年 | 1篇 |
2014年 | 4篇 |
2013年 | 10篇 |
2012年 | 2篇 |
2011年 | 7篇 |
2010年 | 11篇 |
2009年 | 13篇 |
2008年 | 17篇 |
2007年 | 6篇 |
2006年 | 11篇 |
2005年 | 2篇 |
2004年 | 9篇 |
2003年 | 7篇 |
2002年 | 4篇 |
2001年 | 3篇 |
2000年 | 1篇 |
1999年 | 1篇 |
1998年 | 3篇 |
1997年 | 2篇 |
1996年 | 1篇 |
1995年 | 1篇 |
1994年 | 1篇 |
1993年 | 2篇 |
1991年 | 1篇 |
1990年 | 1篇 |
1986年 | 2篇 |
1984年 | 2篇 |
1981年 | 1篇 |
1979年 | 1篇 |
排序方式: 共有166条查询结果,搜索用时 31 毫秒
101.
设H为G的一个生成子图,(G,H)的一个BB-k-染色是指一个映射f:V(G)→{1,2,…,k},当uv∈E(H),|f(u)-f(v)|≥2;当uv∈E(G)/E(H),|f(u)-f(v)|≥1.定义(G,H)的BB色数x_b(G,H)为最小的整数k,使得(G,H)是BB-k可染的.本文研究了对于任意的连通,非二部平面图G,且G没有5-圈,都存在一棵生成树T,使得x_b(G,T)=4. 相似文献
102.
《Operations Research Letters》2022,50(2):145-149
The hitting number of a polytope P is the smallest size of a subset of vertices of P such that every facet of P has a vertex in the subset. We show that, if P is the base polytope of any matroid, then P admits an extended formulation of linear size on the hitting number of P. Our results generalize those of the spanning tree polytope given by Martin and Wong, and extend to polymatroids. 相似文献
103.
Minimum-weight two-connected spanning networks 总被引:2,自引:0,他引:2
Clyde L. Monma Beth Spellman Munson William R. Pulleyblank 《Mathematical Programming》1990,46(1-3):153-171
We consider the problem of constructing a minimum-weight, two-connected network spanning all the points in a setV. We assume a symmetric, nonnegative distance functiond(·) defined onV × V which satisfies the triangle inequality. We obtain a structural characterization of optimal solutions. Specifically, there exists an optimal two-connected solution whose vertices all have degree 2 or 3, and such that the removal of any edge or pair of edges leaves a bridge in the resulting connected components. These are the strongest possible conditions on the structure of an optimal solution since we also show thatany two-connected graph satisfying these conditions is theunique optimal solution for a particular choice of canonical distances satisfying the triangle inequality. We use these properties to show that the weight of an optimal traveling salesman cycle is at most 4/3 times the weight of an optimal two-connected solution; examples are provided which approach this bound arbitrarily closely. In addition, we obtain similar results for the variation of this problem where the network need only span a prespecified subset of the points. 相似文献
104.
105.
106.
《Indagationes Mathematicae》2019,30(6):1061-1076
107.
108.
In 2009, Kyaw proved that every -vertex connected -free graph with contains a spanning tree with at most 3 leaves. In this paper, we prove an analogue of Kyaw’s result for connected -free graphs. We show that every -vertex connected -free graph with contains a spanning tree with at most 4 leaves. Moreover, the degree sum condition “” is best possible. 相似文献
109.
110.