全文获取类型
收费全文 | 5996篇 |
免费 | 433篇 |
国内免费 | 375篇 |
专业分类
化学 | 255篇 |
晶体学 | 3篇 |
力学 | 42篇 |
综合类 | 143篇 |
数学 | 6031篇 |
物理学 | 330篇 |
出版年
2024年 | 16篇 |
2023年 | 108篇 |
2022年 | 180篇 |
2021年 | 148篇 |
2020年 | 209篇 |
2019年 | 237篇 |
2018年 | 235篇 |
2017年 | 213篇 |
2016年 | 134篇 |
2015年 | 107篇 |
2014年 | 207篇 |
2013年 | 564篇 |
2012年 | 210篇 |
2011年 | 341篇 |
2010年 | 332篇 |
2009年 | 504篇 |
2008年 | 452篇 |
2007年 | 355篇 |
2006年 | 365篇 |
2005年 | 245篇 |
2004年 | 225篇 |
2003年 | 194篇 |
2002年 | 185篇 |
2001年 | 166篇 |
2000年 | 153篇 |
1999年 | 145篇 |
1998年 | 126篇 |
1997年 | 89篇 |
1996年 | 51篇 |
1995年 | 56篇 |
1994年 | 49篇 |
1993年 | 31篇 |
1992年 | 28篇 |
1991年 | 16篇 |
1990年 | 16篇 |
1989年 | 20篇 |
1988年 | 15篇 |
1987年 | 10篇 |
1986年 | 6篇 |
1985年 | 12篇 |
1984年 | 13篇 |
1983年 | 6篇 |
1982年 | 12篇 |
1981年 | 3篇 |
1980年 | 4篇 |
1979年 | 1篇 |
1977年 | 3篇 |
1976年 | 1篇 |
1975年 | 4篇 |
1974年 | 2篇 |
排序方式: 共有6804条查询结果,搜索用时 203 毫秒
991.
992.
《Discrete Mathematics》2022,345(12):113083
Let G be a graph, the order of G, the connectivity of G and k a positive integer such that . Then G is said to be k-extendable if it has a matching of size k and every matching of size k extends to a perfect matching of G. A Hamiltonian path of a graph G is a spanning path of G. A bipartite graph G with vertex sets and is defined to be Hamiltonian-laceable if such that and for every pair of vertices and , there exists a Hamiltonian path in G with endpoints p and q, or and for every pair of vertices , there exists a Hamiltonian path in G with endpoints p and q. Let G be a bipartite graph with bipartition . Define to be a maximum integer such that and (1) for each non-empty subset S of X, if , then , and if , then ; and (2) for each non-empty subset S of Y, if , then , and if , then ; and (3) if there is no non-negative integer satisfying (1) and (2).Let G be a bipartite graph with bipartition such that and . In this paper, we show that if , then G is Hamiltonian-laceable; or if , then for every pair of vertices and , there is an -path P in G with . We show some of its corollaries in k-extendable, bipartite graphs and a conjecture in k-extendable graphs. 相似文献
993.
994.
《Discrete Mathematics》2020,343(12):112118
995.
Given a graph we are interested in studying the symmetric matrices associated to with a fixed number of negative eigenvalues. For this class of matrices we focus on the maximum possible nullity. For trees this parameter has already been studied and plenty of applications are known. In this work we derive a formula for the maximum nullity and completely describe its behavior as a function of the number of negative eigenvalues. In addition, we also carefully describe the matrices associated with trees that attain this maximum nullity. The analysis is then extended to the more general class of unicyclic graphs. Further our work is applied to re-describing all possible partial inertias associated with trees, and is employed to study an instance of the inverse eigenvalue problem for certain trees. 相似文献
996.
997.
Given two graphs and , a graph is -free if it contains no induced subgraph isomorphic to or . Let and be the path on vertices and the cycle on vertices, respectively. In this paper we show that for any -free graph it holds that , where and are the chromatic number and clique number of , respectively. Our bound is attained by several graphs, for instance, the 5-cycle, the Petersen graph, the Petersen graph with an additional universal vertex, and all -critical -free graphs other than (see Hell and Huang [Discrete Appl. Math. 216 (2017), pp. 211–232]). The new result unifies previously known results on the existence of linear -binding functions for several graph classes. Our proof is based on a novel structure theorem on -free graphs that do not contain clique cutsets. Using this structure theorem we also design a polynomial time -approximation algorithm for coloring -free graphs. Our algorithm computes a coloring with colors for any -free graph in time. 相似文献
998.
《Discrete Mathematics》2019,342(1):233-249
A Weyl arrangement is the hyperplane arrangement defined by a root system. Saito proved that every Weyl arrangement is free. The Weyl subarrangements of type are represented by simple graphs. Stanley gave a characterization of freeness for this type of arrangements in terms of their graph. In addition, the Weyl subarrangements of type can be represented by signed graphs. A characterization of freeness for them is not known. However, characterizations of freeness for a few restricted classes are known. For instance, Edelman and Reiner characterized the freeness of the arrangements between type and type . In this paper, we give a characterization of the freeness and supersolvability of the Weyl subarrangements of type under certain assumption. 相似文献
999.
《Discrete Mathematics》2019,342(12):111615
In this paper, all simple connected signed graphs with maximum degree at most 4 and with just two distinct adjacency eigenvalues are completely characterized, there exists an infinite family of 4-regular signed graphs with just two distinct adjacency eigenvalues. 相似文献
1000.
Recently, Balogh et al. (2018) answered in negative the question that was posed in several earlier papers whether the packing chromatic number is bounded in the class of graphs with maximum degree 3. In this note, we present an explicit infinite family of subcubic graphs with unbounded packing chromatic number. 相似文献