全文获取类型
收费全文 | 256篇 |
免费 | 26篇 |
国内免费 | 28篇 |
专业分类
力学 | 4篇 |
综合类 | 11篇 |
数学 | 287篇 |
物理学 | 8篇 |
出版年
2023年 | 1篇 |
2022年 | 7篇 |
2021年 | 2篇 |
2020年 | 13篇 |
2019年 | 7篇 |
2018年 | 8篇 |
2017年 | 13篇 |
2016年 | 6篇 |
2015年 | 4篇 |
2014年 | 6篇 |
2013年 | 22篇 |
2012年 | 6篇 |
2011年 | 13篇 |
2010年 | 18篇 |
2009年 | 29篇 |
2008年 | 21篇 |
2007年 | 10篇 |
2006年 | 27篇 |
2005年 | 11篇 |
2004年 | 7篇 |
2003年 | 10篇 |
2002年 | 13篇 |
2001年 | 8篇 |
2000年 | 9篇 |
1999年 | 8篇 |
1998年 | 3篇 |
1997年 | 7篇 |
1996年 | 5篇 |
1995年 | 3篇 |
1994年 | 3篇 |
1993年 | 1篇 |
1992年 | 2篇 |
1991年 | 2篇 |
1988年 | 1篇 |
1983年 | 1篇 |
1980年 | 1篇 |
1979年 | 2篇 |
排序方式: 共有310条查询结果,搜索用时 31 毫秒
1.
2.
Sebastián González Hermosillo de la Maza César Hernández-Cruz 《Discrete Mathematics》2018,341(3):638-651
Let be a digraph. A subset is -independent if the distance between every pair of vertices of is at least , and it is -absorbent if for every vertex in there exists such that the distance from to is less than or equal to . A -kernel is a -independent and -absorbent set. A kernel is simply a -kernel.A classical result due to Duchet states that if every directed cycle in a digraph has at least one symmetric arc, then has a kernel. We propose a conjecture generalizing this result for -kernels and prove it true for and . 相似文献
3.
4.
5.
A (di)graph is supereulerian if it contains a spanning eulerian sub(di)graph. This property is a relaxation of hamiltonicity. Inspired by this analogy with hamiltonian cycles and by similar results in supereulerian graph theory, we analyze a number of sufficient Ore type conditions for a digraph to be supereulerian. Furthermore, we study the following conjecture due to Thomassé and the first author: if the arc‐connectivity of a digraph is not smaller than its independence number, then the digraph is supereulerian. As a support for this conjecture we prove it for digraphs that are semicomplete multipartite or quasitransitive and verify the analogous statement for undirected graphs. 相似文献
6.
Jørgen Bang-Jensen Thomas Bellitto Thomas Schweser Michael Stiebitz 《Journal of Graph Theory》2020,95(1):76-98
DP-coloring is a relatively new coloring concept by Dvořák and Postle and was introduced as an extension of list-colorings of (undirected) graphs. It transforms the problem of finding a list-coloring of a given graph with a list-assignment to finding an independent transversal in an auxiliary graph with vertex set . In this paper, we extend the definition of DP-colorings to digraphs using the approach from Neumann-Lara where a coloring of a digraph is a coloring of the vertices such that the digraph does not contain any monochromatic directed cycle. Furthermore, we prove a Brooks’ type theorem regarding the DP-chromatic number, which extends various results on the (list-)chromatic number of digraphs. 相似文献
7.
8.
9.
《Journal of Graph Theory》2018,89(1):64-75
A digraph D is supereulerian if D has a spanning closed ditrail. Bang‐Jensen and Thomassé conjectured that if the arc‐strong connectivity of a digraph D is not less than the independence number , then D is supereulerian. A digraph is bipartite if its underlying graph is bipartite. Let be the size of a maximum matching of D. We prove that if D is a bipartite digraph satisfying , then D is supereulerian. Consequently, every bipartite digraph D satisfying is supereulerian. The bound of our main result is best possible. 相似文献
10.