全文获取类型
收费全文 | 944篇 |
免费 | 119篇 |
国内免费 | 50篇 |
专业分类
化学 | 26篇 |
力学 | 4篇 |
综合类 | 12篇 |
数学 | 1041篇 |
物理学 | 30篇 |
出版年
2024年 | 1篇 |
2023年 | 17篇 |
2022年 | 32篇 |
2021年 | 13篇 |
2020年 | 51篇 |
2019年 | 42篇 |
2018年 | 43篇 |
2017年 | 37篇 |
2016年 | 26篇 |
2015年 | 23篇 |
2014年 | 47篇 |
2013年 | 71篇 |
2012年 | 55篇 |
2011年 | 83篇 |
2010年 | 69篇 |
2009年 | 100篇 |
2008年 | 75篇 |
2007年 | 40篇 |
2006年 | 70篇 |
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篇 |
排序方式: 共有1113条查询结果,搜索用时 15 毫秒
61.
62.
关于联图K_(2,n)∨P_m的邻点可区别的全染色 总被引:1,自引:0,他引:1
一个全染色被称为邻点可区别的如果它满足对任意两个相邻点所关联的色集合不同.本文给出了联图K2,n∨Pm的邻点可区别的全色数并且证明了它满足邻点可区别的全染色猜想. 相似文献
63.
Giuseppe Confessore Paolo Dell''Olmo Stefano Giordani 《Discrete Applied Mathematics》2002,120(1-3):73-90
We study the problem of finding an acyclic orientation of an undirected graph, such that each (oriented) path is covered by a limited number k of maximal cliques. This is equivalent to finding a k-approximate solution for the interval coloring problem on a graph. We focus our attention on claw-free chordal graphs, and show how to find an orientation of such a graph in linear time, which guarantees that each path is covered by at most two maximal cliques. This extends previous published results on other graph classes where stronger assumptions were made. 相似文献
64.
D(β)-vertex-distinguishing total coloring of graphs 总被引:1,自引:0,他引:1
Zhang Zhongfu Li Jingwen Chen Xiangen Yao Bing Wang Wenjie Qiu Pengxiang 《中国科学A辑(英文版)》2006,49(10):1430-1440
A new concept of the D(β)-vertex-distinguishing total coloring of graphs, i.e., the proper total coloring such that any two vertices whose distance
is not larger than β have different color sets, where the color set of a vertex is the set composed of all colors of the vertex and the edges
incident to it, is proposed in this paper. The D(2)-vertex-distinguishing total colorings of some special graphs are discussed, meanwhile, a conjecture and an open problem
are presented. 相似文献
65.
设f:V(G)∪E(G)→{1,2,…,k}是图G的一个正常k-全染色。令■其中N(x)={y∈V(G)|xy∈E(G)}。对任意的边uv∈E(C),若有Φ(u)≠Φ(v)成立,则称f是图G的一个邻点全和可区别k-全染色。图G的邻点全和可区别全染色中最小的颜色数k叫做G的邻点全和可区别全色数,记为f tndi∑(G)。本文确定了路、圈、星、轮、完全二部图、完全图以及树的邻点全和可区别全色数,同时猜想:简单图G(≠K2)的邻点全和可区别全色数不超过△(G)+2。 相似文献
66.
67.
John Engbers 《Journal of Graph Theory》2017,85(4):780-787
For graphs G and H , an H‐coloring of G is a map from the vertices of G to the vertices of H that preserves edge adjacency. We consider the following extremal enumerative question: for a given H , which connected n‐vertex graph with minimum degree δ maximizes the number of H‐colorings? We show that for nonregular H and sufficiently large n , the complete bipartite graph is the unique maximizer. As a corollary, for nonregular H and sufficiently large n the graph is the unique k‐connected graph that maximizes the number of H‐colorings among all k‐connected graphs. Finally, we show that this conclusion does not hold for all regular H by exhibiting a connected n‐vertex graph with minimum degree δ that has more ‐colorings (for sufficiently large q and n ) than . 相似文献
68.
Vizing conjectured that every edge chromatic critical graph contains a 2-factor. Believing that stronger properties hold for this class of graphs, Luo and Zhao (2013) showed that every edge chromatic critical graph of order with maximum degree at least is Hamiltonian. Furthermore, Luo et al. (2016) proved that every edge chromatic critical graph of order with maximum degree at least is Hamiltonian. In this paper, we prove that every edge chromatic critical graph of order with maximum degree at least is Hamiltonian. Our approach is inspired by the recent development of Kierstead path and Tashkinov tree techniques for multigraphs. 相似文献
69.
Consider a simple graph and its proper edge coloring c with the elements of the set . We say that c is neighbor set distinguishing (or adjacent strong) if for every edge , the set of colors incident with u is distinct from the set of colors incident with v. Let us then consider a stronger requirement and suppose we wish to distinguishing adjacent vertices by sums of their incident colors. In both problems the challenging conjectures presume that such colorings exist for any graph G containing no isolated edges if only . We prove that in both problems is sufficient. The proof is based on the Combinatorial Nullstellensatz, applied in the “sum environment.” In fact the identical bound also holds if we use any set of k real numbers instead of as edge colors, and the same is true in list versions of the both concepts. In particular, we therefore obtain that lists of length ( in fact) are sufficient for planar graphs. 相似文献
70.
Fast determination of neighboring atoms is an essential step in molecular dynamics simulations or Monte Carlo computations, and there exists a variety of algorithms to efficiently compute neighbor lists. However, most of these algorithms are general, and not specifically designed for a given type of application. As a result, although their average performance is satisfactory, they might be inappropriate in some specific application domains. In this article, we study the case of detecting neighbors between large rigid molecules, which has applications in, e.g., rigid body molecular docking, Monte Carlo simulations of molecular self-assembly or diffusion, and rigid body molecular dynamics simulations. More precisely, we compare the traditional grid-based algorithm to a series of hierarchy-based algorithms that use bounding volumes to rapidly eliminate large groups of irrelevant pairs of atoms during the neighbor search. We compare the performance of these algorithms based on several parameters: the size of the molecules, the average distance between them, the cutoff distance, as well as the type of bounding volume used in the culling hierarchy (AABB, OBB, wrapped, or layered spheres). We demonstrate that for relatively large systems (> 100,000 atoms) the algorithm based on the hierarchy of wrapped spheres shows the best results and the traditional grid-based algorithm gives the worst timings. For small systems, however, the grid-based algorithm and the one based on the wrapped sphere hierarchy are beneficial. 相似文献