共查询到20条相似文献,搜索用时 31 毫秒
1.
2.
3.
4.
5.
6.
7.
Brooks’ theorem is a fundamental result in the theory of graph coloring. Catlin proved the following strengthening of Brooks’ theorem: Let d be an integer at least 3, and let G be a graph with maximum degree d. If G does not contain Kd+1 as a subgraph, then G has a d-coloring in which one color class has size α(G). Here α(G) denotes the independence number of G. We give a unified proof of Brooks’ theorem and Catlin’s theorem. 相似文献
8.
Let (X,d) be a metric space endowed with a graph G such that the set V(G) of vertices of G coincides with X. We define the notion of G-Reich type maps and obtain a fixed point theorem for such mappings. This extends and subsumes many recent results which were obtained for other contractive type mappings on ordered metric spaces and for cyclic operators. 相似文献
9.
10.
11.
Let us fix a function f(n)=o(nlnn) and real numbers 0≤α<β≤1. We present a polynomial time algorithm which, given a directed graph G with n vertices, decides either that one can add at most βn new edges to G so that G acquires a Hamiltonian circuit or that one cannot add αn or fewer new edges to G so that G acquires at least e−f(n)n! Hamiltonian circuits, or both. 相似文献
12.
14.
15.
16.
Let F be either the real number field R or the complex number field C and RPn the real projective space of dimension n. Theorems A and C in Hemmi and Kobayashi (2008) [2] give necessary and sufficient conditions for a given F-vector bundle over RPn to be stably extendible to RPm for every m?n. In this paper, we simplify the theorems and apply them to the tangent bundle of RPn, its complexification, the normal bundle associated to an immersion of RPn in Rn+r(r>0), and its complexification. Our result for the normal bundle is a generalization of Theorem A in Kobayashi et al. (2000) [8] and that for its complexification is a generalization of Theorem 1 in Kobayashi and Yoshida (2003) [5]. 相似文献
17.
18.
19.