全文获取类型
收费全文 | 3894篇 |
免费 | 170篇 |
国内免费 | 114篇 |
专业分类
化学 | 368篇 |
晶体学 | 4篇 |
力学 | 371篇 |
综合类 | 31篇 |
数学 | 3020篇 |
物理学 | 384篇 |
出版年
2024年 | 13篇 |
2023年 | 76篇 |
2022年 | 97篇 |
2021年 | 68篇 |
2020年 | 130篇 |
2019年 | 121篇 |
2018年 | 121篇 |
2017年 | 124篇 |
2016年 | 85篇 |
2015年 | 87篇 |
2014年 | 153篇 |
2013年 | 324篇 |
2012年 | 99篇 |
2011年 | 209篇 |
2010年 | 205篇 |
2009年 | 357篇 |
2008年 | 297篇 |
2007年 | 233篇 |
2006年 | 246篇 |
2005年 | 175篇 |
2004年 | 130篇 |
2003年 | 136篇 |
2002年 | 90篇 |
2001年 | 77篇 |
2000年 | 73篇 |
1999年 | 76篇 |
1998年 | 76篇 |
1997年 | 54篇 |
1996年 | 29篇 |
1995年 | 10篇 |
1994年 | 24篇 |
1993年 | 22篇 |
1992年 | 19篇 |
1991年 | 14篇 |
1990年 | 14篇 |
1989年 | 12篇 |
1988年 | 13篇 |
1987年 | 10篇 |
1986年 | 6篇 |
1985年 | 17篇 |
1984年 | 17篇 |
1983年 | 6篇 |
1982年 | 10篇 |
1981年 | 5篇 |
1980年 | 3篇 |
1979年 | 6篇 |
1978年 | 5篇 |
1977年 | 3篇 |
1970年 | 1篇 |
排序方式: 共有4178条查询结果,搜索用时 31 毫秒
1.
2.
For an integer , a graph is -hamiltonian if for any vertex subset with , is hamiltonian, and is -hamiltonian connected if for any vertex subset with , is hamiltonian connected. Thomassen in 1984 conjectured that every 4-connected line graph is hamiltonian (see Thomassen, 1986), and Ku?zel and Xiong in 2004 conjectured that every 4-connected line graph is hamiltonian connected (see Ryjá?ek and Vrána, 2011). In Broersma and Veldman (1987), Broersma and Veldman raised the characterization problem of -hamiltonian line graphs. In Lai and Shao (2013), it is conjectured that for , a line graph is -hamiltonian if and only if is -connected. In this paper we prove the following.(i) For an integer , the line graph of a claw-free graph is -hamiltonian if and only if is -connected.(ii) The line graph of a claw-free graph is 1-hamiltonian connected if and only if is 4-connected. 相似文献
3.
4.
5.
Given an ‐vertex pseudorandom graph and an ‐vertex graph with maximum degree at most two, we wish to find a copy of in , that is, an embedding so that for all . Particular instances of this problem include finding a triangle‐factor and finding a Hamilton cycle in . Here, we provide a deterministic polynomial time algorithm that finds a given in any suitably pseudorandom graph . The pseudorandom graphs we consider are ‐bijumbled graphs of minimum degree which is a constant proportion of the average degree, that is, . A ‐bijumbled graph is characterised through the discrepancy property: for any two sets of vertices and . Our condition on bijumbledness is within a log factor from being tight and provides a positive answer to a recent question of Nenadov. We combine novel variants of the absorption‐reservoir method, a powerful tool from extremal graph theory and random graphs. Our approach builds on our previous work, incorporating the work of Nenadov, together with additional ideas and simplifications. 相似文献
6.
7.
8.
Martín D. Safe 《Journal of Graph Theory》2020,93(2):268-298
A graph is concave-round if its vertices can be circularly enumerated so that the closed neighborhood of each vertex is an interval in the enumeration. In this study, we give a minimal forbidden induced subgraph characterization for the class of concave-round graphs, solving a problem posed by Bang-Jensen, Huang, and Yeo [SIAM J. Discrete Math., 13 (2000), pp. 179–193]. In addition, we show that it is possible to find one such forbidden induced subgraph in linear time in any given graph that is not concave-round. As part of the analysis, we obtain characterizations by minimal forbidden submatrices for the circular-ones property for rows and for the circular-ones property for rows and columns and show that, also for both variants of the property, one of the corresponding forbidden submatrices can be found (if present) in any given matrix in linear time. We make some final remarks regarding connections to some classes of circular-arc graphs. 相似文献
9.
We give a sheaf theoretic interpretation of Potts models with external magnetic field, in terms of constructible sheaves and their Euler characteristics. We show that the polynomial countability question for the hypersurfaces defined by the vanishing of the partition function is affected by changes in the magnetic field: elementary examples suffice to see non-polynomially countable cases that become polynomially countable after a perturbation of the magnetic field. The same recursive formula for the Grothendieck classes, under edge-doubling operations, holds as in the case without magnetic field, but the closed formulae for specific examples like banana graphs differ in the presence of magnetic field. We give examples of computation of the Euler characteristic with compact support, for the set of real zeros, and find a similar exponential growth with the size of the graph. This can be viewed as a measure of topological and algorithmic complexity. We also consider the computational complexity question for evaluations of the polynomial, and show both tractable and NP-hard examples, using dynamic programming. 相似文献
10.
In this paper, we will propose algorithms for calculating a minimal ellipsoid circumscribing a polytope defined by a system
of linear inequalities. If we know all vertices of the polytope and its cardinality is not very large, we can solve the problem
in an efficient manner by a number of existent algorithms. However, when the polytope is defined by linear inequalities, these
algorithms may not work since the cardinality of vertices may be huge. Based on a fact that vertices determining an ellipsoid
are only a fraction of these vertices, we propose algorithms which iteratively calculate an ellipsoid which covers a subset
of vertices. Numerical experiment shows that these algorithms perform well for polytopes of dimension up to seven. 相似文献