全文获取类型
收费全文 | 94篇 |
免费 | 15篇 |
专业分类
化学 | 2篇 |
数学 | 104篇 |
物理学 | 3篇 |
出版年
2023年 | 3篇 |
2022年 | 2篇 |
2021年 | 1篇 |
2020年 | 7篇 |
2019年 | 7篇 |
2018年 | 6篇 |
2017年 | 3篇 |
2016年 | 3篇 |
2015年 | 2篇 |
2014年 | 8篇 |
2013年 | 5篇 |
2012年 | 1篇 |
2011年 | 6篇 |
2010年 | 6篇 |
2009年 | 6篇 |
2008年 | 7篇 |
2007年 | 8篇 |
2006年 | 5篇 |
2004年 | 1篇 |
2003年 | 4篇 |
2002年 | 2篇 |
2001年 | 2篇 |
2000年 | 2篇 |
1999年 | 2篇 |
1998年 | 5篇 |
1996年 | 1篇 |
1991年 | 1篇 |
1990年 | 1篇 |
1988年 | 1篇 |
1976年 | 1篇 |
排序方式: 共有109条查询结果,搜索用时 31 毫秒
81.
For each surface Σ, we define max G is a class two graph of maximum degree that can be embedded in . Hence, Vizing's Planar Graph Conjecture can be restated as if Σ is a sphere. In this article, by applying some newly obtained adjacency lemmas, we show that if Σ is a surface of characteristic . Until now, all known satisfy . This is the first case where . 相似文献
82.
For a connected graph G and any two vertices u and v in G, let D(u,v) denote the length of a longest u-v path in G. A hamiltonian coloring of a connected graph G of order n is an assignment c of colors (positive integers) to the vertices of G such that |c(u)−c(v)|+D(u,v)≥n−1 for every two distinct vertices u and v in G. The value of a hamiltonian coloring c is the maximum color assigned to a vertex of G. The hamiltonian chromatic number of G is taken over all hamiltonian colorings c of G. In this paper we discuss the hamiltonian chromatic number of graphs G with . As examples, we determine the hamiltonian chromatic number for a class of caterpillars, and double stars. 相似文献
83.
Manouchehr Zaker 《Journal of Graph Theory》2008,58(2):110-122
In this article we first give an upper bound for the chromatic number of a graph in terms of its degrees. This bound generalizes and modifies the bound given in 11 . Next, we obtain an upper bound of the order of magnitude for the coloring number of a graph with small K2,t (as subgraph), where n is the order of the graph. Finally, we give some bounds for chromatic number in terms of girth and book size. These bounds improve the best known bound, in terms of order and girth, for the chromatic number of a graph when its girth is an even integer. © 2008 Wiley Periodicals, Inc. J Graph Theory 58:110–122, 2008 相似文献
84.
R. V. Ambartzumian 《Journal of Contemporary Mathematical Analysis (Armenian Academy of Sciences)》2008,43(1):3-20
Many results in Combinatorial Integral Geometry are derived by integration of the combinatorial decompositions associated with finite point sets {P i } given in the plane ?2. However, most previous cases of integration of the decompositions in question were carried out for the point sets {P i } containing no triads of collinear points, where the familiar algorithm sometimes called the “Four indicator formula” can be used. The present paper is to demonstrate that the complete combinatorial algorithm valid for sets {P i } not subject to the mentioned restriction opens the path to various results, including the field of Stochastic Geometry. In the paper the complete algorithm is applied first in an integration procedure in a study of the perforated convex domains, i.e convex domains containing a finite array of non-overlapping convex holes. The second application is in the study of random colorings of the plane that are Euclidean motions invariant in distribution, basing on the theory of random polygonal windows from the so-called Independent Angles (IA) class. The method is a direct averaging of the complete combinatorial decompositions written for colorings observed in polygonal windows from the IA class. The approach seems to be quite general, but promises to be especially effective for the random coloring generated by random Poisson polygon process governed by the Haar measure on the group of Euclidean motions of the plane, assuming that a point P ∈ ?2 is colored J if P is covered by exactly J polygons of the Poisson process. A general theorem clearing the way for Laplace transform treatment of the random colorings induced on line segments is formulated. 相似文献
85.
In this paper, we prove that any graph G with maximum degree , which is embeddable in a surface Σ of characteristic χ(Σ) ≤ 1 and satisfies , is class one. © 2000 John Wiley & Sons, Inc. J Graph Theory 35: 197–205, 2000 相似文献
86.
A 3‐uniform hypergraph is called a minimum 3‐tree, if for any 3‐coloring of its vertex set there is a heterochromatic edge and the hypergraph has the minimum possible number of edges. Here we show that the number of edges in such 3‐tree is for any number of vertices n ≡ 3, 4 (mod 6). © 1999 John Wiley & Sons, Inc. J Graph Theory 30: 157‐166, 1999 相似文献
87.
《Discrete Mathematics》2022,345(6):112830
Given a matroid together with a coloring of its ground set, a subset of its elements is called rainbow colored if no two of its elements have the same color. We show that if an n-element rank r binary matroid M is colored with exactly r colors, then M either contains a rainbow colored circuit or a monochromatic cocircuit. As the class of binary matroids is closed under taking duals, this immediately implies that if M is colored with exactly colors, then M either contains a rainbow colored cocircuit or a monochromatic circuit. As a byproduct, we give a characterization of binary matroids in terms of reductions to partition matroids.Motivated by a conjecture of Bérczi, Schwarcz and Yamaguchi, we also analyze the relation between the covering number of a binary matroid and the maximum number of colors or the maximum size of a color class in any of its rainbow circuit-free colorings. For simple graphic matroids, we show that there exists a rainbow circuit-free coloring that uses each color at most twice only if the graph is -sparse, that is, it is independent in the 2-dimensional rigidity matroid. Furthermore, we give a complete characterization of minimally rigid graphs admitting such a coloring. 相似文献
88.
Jaehoon Kim Daniela Kühn Andrey Kupavskii Deryk Osthus 《Random Structures and Algorithms》2020,56(4):1171-1204
We study approximate decompositions of edge‐colored quasirandom graphs into rainbow spanning structures: an edge‐coloring of a graph is locally ‐bounded if every vertex is incident to at most edges of each color, and is (globally) ‐bounded if every color appears at most times. Our results imply the existence of: (1) approximate decompositions of properly edge‐colored into rainbow almost‐spanning cycles; (2) approximate decompositions of edge‐colored into rainbow Hamilton cycles, provided that the coloring is ‐bounded and locally ‐bounded; and (3) an approximate decomposition into full transversals of any array, provided each symbol appears times in total and only times in each row or column. Apart from the logarithmic factors, these bounds are essentially best possible. We also prove analogues for rainbow ‐factors, where is any fixed graph. Both (1) and (2) imply approximate versions of the Brualdi‐Hollingsworth conjecture on decompositions into rainbow spanning trees. 相似文献
89.
Krishnan Balasubramanian 《Journal of computational chemistry》2020,41(7):653-686
In the present study, we compute and enumerate the colorings of 7D-hypercube for all of its hyperplanes (q = 1–7) for all 110 irreducible representations (IRs) of the seventh-dimensional hyperoctahedral group consisting of 645,120 symmetry operations. The computations of colorings of the 7D-hypercube are motivated by a number of chemical and biological applications such as the 7D-hypercube representation of the periodic table, hypercube representations of water heptamer clusters, genetic regulatory networks, isomerization graphs, massively large data representations, and so forth. We have employed the Möbius inversion technique combined with generalized character cycle indices for 110 IRs to compute the generating functions for colorings of seven different types of hyperplanes of the 7D-hypercube varying from the vertices (q = 7) to hexeracts (q = 1) of the 7D-hypercube. Explicit computed tables are provided for 110 IRs from q = 1 to q = 7 for the 7D-hypercube. © 2019 Wiley Periodicals, Inc. 相似文献
90.