全文获取类型
收费全文 | 6233篇 |
免费 | 208篇 |
国内免费 | 99篇 |
专业分类
化学 | 3151篇 |
晶体学 | 23篇 |
力学 | 50篇 |
综合类 | 39篇 |
数学 | 2716篇 |
物理学 | 561篇 |
出版年
2024年 | 12篇 |
2023年 | 48篇 |
2022年 | 69篇 |
2021年 | 61篇 |
2020年 | 242篇 |
2019年 | 417篇 |
2018年 | 163篇 |
2017年 | 372篇 |
2016年 | 142篇 |
2015年 | 156篇 |
2014年 | 186篇 |
2013年 | 301篇 |
2012年 | 217篇 |
2011年 | 302篇 |
2010年 | 212篇 |
2009年 | 352篇 |
2008年 | 375篇 |
2007年 | 331篇 |
2006年 | 320篇 |
2005年 | 242篇 |
2004年 | 254篇 |
2003年 | 248篇 |
2002年 | 214篇 |
2001年 | 196篇 |
2000年 | 148篇 |
1999年 | 140篇 |
1998年 | 109篇 |
1997年 | 123篇 |
1996年 | 89篇 |
1995年 | 50篇 |
1994年 | 47篇 |
1993年 | 44篇 |
1992年 | 32篇 |
1991年 | 30篇 |
1990年 | 23篇 |
1989年 | 21篇 |
1988年 | 15篇 |
1987年 | 11篇 |
1986年 | 15篇 |
1985年 | 29篇 |
1984年 | 26篇 |
1983年 | 11篇 |
1982年 | 12篇 |
1981年 | 22篇 |
1980年 | 18篇 |
1979年 | 20篇 |
1978年 | 23篇 |
1977年 | 18篇 |
1976年 | 9篇 |
1973年 | 8篇 |
排序方式: 共有6540条查询结果,搜索用时 46 毫秒
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.
Bingjie Chen Dr. Lianhai Zu Dr. Yao Liu Dr. Ruijing Meng Yutong Feng Prof. Chengxin Peng Feng Zhu Tianzi Hao Jiajia Ru Prof. Yonggang Wang Prof. Jinhu Yang 《Angewandte Chemie (Weinheim an der Bergstrasse, Germany)》2020,132(8):3161-3166
Incorporating nanoscale Si into a carbon matrix with high dispersity is desirable for the preparation of lithium-ion batteries (LIBs) but remains challenging. A space-confined catalytic strategy is proposed for direct superassembly of Si nanodots within a carbon (Si NDs⊂C) framework by copyrolysis of triphenyltin hydride (TPT) and diphenylsilane (DPS), where Sn atomic clusters created from TPT pyrolysis serve as the catalyst for DPS pyrolysis and Si catalytic growth. The use of Sn atomic cluster catalysts alters the reaction pathway to avoid SiC generation and enable formation of Si NDs with reduced dimensions. A typical Si NDs⊂C framework demonstrates a remarkable comprehensive performance comparable to other Si-based high-performance half LIBs, and higher energy densities compared to commercial full LIBs, as a consequence of the high dispersity of Si NDs with low lithiation stress. Supported by mechanic simulations, this study paves the way for construction of Si/C composites suitable for applications in future energy technologies. 相似文献
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.
10.
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. 相似文献