全文获取类型
收费全文 | 953篇 |
免费 | 119篇 |
国内免费 | 50篇 |
专业分类
化学 | 26篇 |
力学 | 4篇 |
综合类 | 12篇 |
数学 | 1044篇 |
物理学 | 36篇 |
出版年
2024年 | 4篇 |
2023年 | 17篇 |
2022年 | 36篇 |
2021年 | 13篇 |
2020年 | 51篇 |
2019年 | 42篇 |
2018年 | 43篇 |
2017年 | 37篇 |
2016年 | 26篇 |
2015年 | 23篇 |
2014年 | 48篇 |
2013年 | 71篇 |
2012年 | 55篇 |
2011年 | 83篇 |
2010年 | 69篇 |
2009年 | 100篇 |
2008年 | 75篇 |
2007年 | 40篇 |
2006年 | 71篇 |
2005年 | 39篇 |
2004年 | 32篇 |
2003年 | 25篇 |
2002年 | 28篇 |
2001年 | 16篇 |
2000年 | 15篇 |
1999年 | 20篇 |
1998年 | 13篇 |
1997年 | 10篇 |
1996年 | 1篇 |
1995年 | 4篇 |
1994年 | 3篇 |
1993年 | 3篇 |
1990年 | 1篇 |
1988年 | 1篇 |
1987年 | 1篇 |
1986年 | 1篇 |
1985年 | 2篇 |
1984年 | 1篇 |
1970年 | 1篇 |
1967年 | 1篇 |
排序方式: 共有1122条查询结果,搜索用时 15 毫秒
111.
田京京 《数学的实践与认识》2010,40(12)
根据平方图的结构性质,用穷染,递推的方法,讨论了路,圈,扇的平方图的点边邻点可区别全染色,得到了相应的色数,即并给出了一种染色方案. 相似文献
112.
113.
114.
如果图G的一个正常边染色满足相邻点的色集不同,且任意两种颜色所染边数目相差不超过1,则称为均匀邻强边染色,其所用最少染色数称为均匀邻强边色数.本文得到了路、圈、星和扇的Mycielski图的均匀邻强边色数. 相似文献
115.
116.
B. Ries 《Discrete Applied Mathematics》2010,158(5):592-596
In this note we consider two coloring problems in mixed graphs, i.e., graphs containing edges and arcs, which arise from scheduling problems where disjunctive and precedence constraints have to be taken into account. We show that they are both NP-complete in cubic planar bipartite mixed graphs, which strengthens some results of Ries and de Werra (2008) [9]. 相似文献
117.
We study backbone colorings, a variation on classical vertex colorings: Given a graph G and a subgraph H of G (the backbone of G), a backbone coloring for G and H is a proper vertex k-coloring of G in which the colors assigned to adjacent vertices in H differ by at least 2. The minimal k∈N for which such a coloring exists is called the backbone chromatic number of G. We show that for a graph G of maximum degree Δ where the backbone graph is a d-degenerated subgraph of G, the backbone chromatic number is at most Δ+d+1 and moreover, in the case when the backbone graph being a matching we prove that the backbone chromatic number is at most Δ+1. We also present examples where these bounds are attained.Finally, the asymptotic behavior of the backbone chromatic number is studied regarding the degrees of G and H. We prove for any sparse graph G that if the maximum degree of a backbone graph is small compared to the maximum degree of G, then the backbone chromatic number is at most . 相似文献
118.
Gintaras Palubeckis 《Discrete Applied Mathematics》2010,158(18):2075-2080
For a graph G and its complement , we define the graph coloring polytope P(G) to be the convex hull of the incidence vectors of star partitions of . We examine inequalities whose support graphs are webs and antiwebs appearing as induced subgraphs in G. We show that for an antiweb in G the corresponding inequality is facet-inducing for P(G) if and only if is critical with respect to vertex colorings. An analogous result is also proved for the web inequalities. 相似文献
119.
Hadwiger's conjecture states that every graph with chromatic number χ has a clique minor of size χ. In this paper we prove a weakened version of this conjecture for the class of claw‐free graphs (graphs that do not have a vertex with three pairwise nonadjacent neighbors). Our main result is that a claw‐free graph with chromatic number χ has a clique minor of size $\lceil\frac{2}{3}\chi\rceil$. © 2009 Wiley Periodicals, Inc. J Graph Theory 63: 259–278, 2010 相似文献
120.