全文获取类型
收费全文 | 2755篇 |
免费 | 179篇 |
国内免费 | 96篇 |
专业分类
化学 | 77篇 |
晶体学 | 1篇 |
力学 | 4篇 |
综合类 | 39篇 |
数学 | 2773篇 |
物理学 | 136篇 |
出版年
2024年 | 12篇 |
2023年 | 50篇 |
2022年 | 81篇 |
2021年 | 53篇 |
2020年 | 114篇 |
2019年 | 107篇 |
2018年 | 96篇 |
2017年 | 95篇 |
2016年 | 62篇 |
2015年 | 51篇 |
2014年 | 90篇 |
2013年 | 241篇 |
2012年 | 80篇 |
2011年 | 137篇 |
2010年 | 146篇 |
2009年 | 255篇 |
2008年 | 205篇 |
2007年 | 154篇 |
2006年 | 166篇 |
2005年 | 109篇 |
2004年 | 96篇 |
2003年 | 94篇 |
2002年 | 76篇 |
2001年 | 69篇 |
2000年 | 67篇 |
1999年 | 62篇 |
1998年 | 49篇 |
1997年 | 41篇 |
1996年 | 24篇 |
1995年 | 11篇 |
1994年 | 18篇 |
1993年 | 15篇 |
1992年 | 12篇 |
1991年 | 8篇 |
1990年 | 12篇 |
1989年 | 12篇 |
1988年 | 10篇 |
1987年 | 3篇 |
1986年 | 4篇 |
1985年 | 13篇 |
1984年 | 11篇 |
1983年 | 3篇 |
1982年 | 7篇 |
1981年 | 3篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1970年 | 1篇 |
排序方式: 共有3030条查询结果,搜索用时 46 毫秒
1.
《Discrete Mathematics》2022,345(10):112984
Let G be a generalized dicyclic group with identity 1. An inverse closed subset S of is called minimal if and there exists some such that . In this paper, we characterize distance-regular Cayley graphs of G under the condition that S is minimal. 相似文献
2.
3.
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. 相似文献
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.
Let ir(G) and γ(G) be the irredundance number and the domination number of a graph G, respectively. A graph G is called irredundance perfect if ir(H)=γ(H), for every induced subgraph H of G. In this article we present a result which immediately implies three known conjectures on irredundance perfect graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 41: 292–306, 2002 相似文献