全文获取类型
收费全文 | 2841篇 |
免费 | 180篇 |
国内免费 | 130篇 |
专业分类
化学 | 115篇 |
晶体学 | 1篇 |
力学 | 11篇 |
综合类 | 34篇 |
数学 | 2833篇 |
物理学 | 157篇 |
出版年
2024年 | 10篇 |
2023年 | 56篇 |
2022年 | 71篇 |
2021年 | 54篇 |
2020年 | 108篇 |
2019年 | 107篇 |
2018年 | 97篇 |
2017年 | 98篇 |
2016年 | 70篇 |
2015年 | 53篇 |
2014年 | 89篇 |
2013年 | 242篇 |
2012年 | 77篇 |
2011年 | 138篇 |
2010年 | 139篇 |
2009年 | 244篇 |
2008年 | 213篇 |
2007年 | 155篇 |
2006年 | 165篇 |
2005年 | 107篇 |
2004年 | 111篇 |
2003年 | 117篇 |
2002年 | 99篇 |
2001年 | 83篇 |
2000年 | 75篇 |
1999年 | 72篇 |
1998年 | 72篇 |
1997年 | 58篇 |
1996年 | 28篇 |
1995年 | 11篇 |
1994年 | 16篇 |
1993年 | 16篇 |
1992年 | 8篇 |
1991年 | 8篇 |
1990年 | 11篇 |
1989年 | 13篇 |
1988年 | 10篇 |
1987年 | 7篇 |
1986年 | 4篇 |
1985年 | 13篇 |
1984年 | 11篇 |
1983年 | 3篇 |
1982年 | 4篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1970年 | 1篇 |
排序方式: 共有3151条查询结果,搜索用时 62 毫秒
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.
Martin Kellert Jan-Simon Jeshua Friedrichs Nadine Anke Ullrich Alexander Feinhals Jonas Tepper Peter Lnnecke Evamarie Hey-Hawkins 《Molecules (Basel, Switzerland)》2021,26(7)
The development of novel, tumor-selective and boron-rich compounds as potential agents for use in boron neutron capture therapy (BNCT) represents a very important field in cancer treatment by radiation therapy. Here, we report the design and synthesis of two promising compounds that combine meta-carborane, a water-soluble monosaccharide and a linking unit, namely glycine or ethylenediamine, for facile coupling with various tumor-selective biomolecules bearing a free amino or carboxylic acid group. In this work, coupling experiments with two selected biomolecules, a coumarin derivative and folic acid, were included. The task of every component in this approach was carefully chosen: the carborane moiety supplies ten boron atoms, which is a tenfold increase in boron content compared to the l-boronophenylalanine (l-BPA) presently used in BNCT; the sugar moiety compensates for the hydrophobic character of the carborane; the linking unit, depending on the chosen biomolecule, acts as the connection between the tumor-selective component and the boron-rich moiety; and the respective tumor-selective biomolecule provides the necessary selectivity. This approach makes it possible to develop a modular and feasible strategy for the synthesis of readily obtainable boron-rich agents with optimized properties for potential applications in BNCT. 相似文献
4.
5.
6.
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. 相似文献
7.
8.
9.
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. 相似文献
10.
Hugh Thomas 《Order》2006,23(2-3):249-269
In this paper, we study lattices that posess both the properties of being extremal (in the sense of Markowsky) and of being left modular (in the sense of Blass and Sagan). We call such lattices trim and show that they posess some additional appealing properties, analogous to those of a distributive lattice. For example, trimness is preserved under taking intervals and suitable sublattices. Trim lattices satisfy a weakened form of modularity. The order complex of a trim lattice is contractible or homotopic to a sphere; the latter holds exactly if the maximum element of the lattice is a join of atoms. Any distributive lattice is trim, but trim lattices need not be graded. The main example of ungraded trim lattices are the Tamari lattices and generalizations of them. We show that the Cambrian lattices in types A and B defined by Reading are trim; we conjecture that all Cambrian lattices are trim. 相似文献