全文获取类型
收费全文 | 100篇 |
免费 | 23篇 |
国内免费 | 49篇 |
专业分类
数学 | 172篇 |
出版年
2015年 | 1篇 |
2014年 | 1篇 |
2012年 | 1篇 |
2010年 | 4篇 |
2009年 | 6篇 |
2008年 | 11篇 |
2007年 | 8篇 |
2006年 | 3篇 |
2005年 | 6篇 |
2004年 | 11篇 |
2003年 | 6篇 |
2002年 | 9篇 |
2001年 | 15篇 |
2000年 | 8篇 |
1999年 | 14篇 |
1998年 | 5篇 |
1997年 | 2篇 |
1996年 | 1篇 |
1995年 | 2篇 |
1994年 | 1篇 |
1993年 | 2篇 |
1992年 | 6篇 |
1991年 | 3篇 |
1990年 | 5篇 |
1989年 | 6篇 |
1988年 | 7篇 |
1987年 | 1篇 |
1986年 | 3篇 |
1985年 | 6篇 |
1984年 | 5篇 |
1983年 | 2篇 |
1982年 | 1篇 |
1981年 | 5篇 |
1979年 | 2篇 |
1978年 | 1篇 |
1975年 | 1篇 |
1974年 | 1篇 |
排序方式: 共有172条查询结果,搜索用时 15 毫秒
21.
22.
Let G be a k(k ≤3)-edge connected simple graph with minimal degree ≥ 3,girth g,r=g12.For any independent set {a1,a2 , . . . , a 6/(4 k)} of G,if,then G is up-embeddable. 相似文献
23.
§ 1 IntroductionA strong embeddingμ( G) of a graph G in a surface S is such an embedding thateachface boundary of the surface is a circuit.( A strong embedding is also sometimes called acircular embedding,see[1 ] orclosed2 -cell embedding[2 ] ) .Graphsconsidered here are sim-ple( that is,they have no loops or multiple edges) .Terminology here follows those in[3] .In[1 ] ,Richter,Seymour and Siran proved that every3-connected planar graph canbe strongly embedded on some non-orientable sur… 相似文献
24.
结合4-边形2-因子条件,确定了一类点的度在modulo4下值为0,1的上可嵌入图类,从而综合已有的结果,较完整地刻划了这类图的上可嵌入性情况。 相似文献
25.
26.
在§10中讨论了研究平面图的面着色只需考查范平面图。且由定理10.5,将四色问题化为确定如下模3方程是否有全非0(mod3)解的问题: 相似文献
27.
刘彦佩 《数学物理学报(B辑英文版)》1992,(4)
This paper presents the number of combinatorially distinct rooted Eulerian planar maps with the number of non-root-vertices and the number of non-root-faces as two parameters. The parametric expressions for determining the number in the loopless Eulerian case are also obtained. 相似文献
28.
29.
For a graph G of size ε≥1 and its edge-induced subgraphs H1 and H2 of size r(1≤r≤ε), H1 is said to be obtained from H2 by an edge jump if there exist four distinct vertices u,v,w and x in G such that (u,v)∈E(H2), (w,x)∈ E(G)-E(H2) and H1=H2-(u,v)+(w,x). In this article, the r-jump graphs (r≥3) are discussed. A graph H is said to be an r-jump graph of G if its vertices correspond to the edge induced graph of size r in G and two vertices are adjacent if and only if one of the two corresponding subgraphs can be obtained from the other by an edge jump. For k≥2, the k-th iterated r-jump graph Jrk(G) is defined as Jr(Jrk-1(G)), where Jr1(G)=Jr(G).An infinite sequence{Gi} of graphs is planar if every graph Gi is planar. It is shown that there does not exist a graph G for which the sequence {J3k(G)} is planar, where k is any positive integer. Meanwhile,lim gen(J3k(G))=∞,where gen(G) denotes the genus of a graph G, if the sequencek→∞J3k(G) is defined for every positive integer k. As for the 4-jump gra 相似文献
30.
SOME CLASSES OF UPPER EMBEDDABLE GRAPHS 总被引:7,自引:0,他引:7
1IntroductionSincetheintroductoryinvestigationofmaximumgenusbyNordhaus,Stewart,andWhite[3],theupperembeddabilityofgraphshasreceivedgreatemphasissofar.AlthoughLiu[16]andNebesky[9]haverespectivelyprovideddifferentnecessaryandsufficientconditionsontheupperembeddabilityofgraphs,weknowlessaboutwhatclassesofgraphsareupperembeddable.Jaeger,PayanandXuong[10]provedthateverygraphobtainedbyconnecting(withanynumberofedges)twovertex-disjointupperembeddablegraphswithevenBettinumberisupperembeddable.Skov… 相似文献