论文部分内容阅读
Induced subgraphs with large degrees at end-vertices for hamiltonicity of claw-free graphs
【机 构】
：
Department of Mathematics, NTIS-New Technologies for the Information Society,University of West Bohe
【出 处】
：
第六届全国组合数学与图论大会
【发表日期】
：
2014年11期
其他文献
Bizley studied a generalization of Dyck paths from (0, 0) to (pd, qd) (gcd(p, q) =1), which never go below the line py =qx with step set {(0, 1), (1, 0)}, and e
会议
Let G be a graph with a nonzero Laplacian eigenvalue μ of multiplicity k.A line star set for μ in G is a set Y of k edges of G such that μ is not a Laplacian
会议
Let A be a magic square of even order n.A is a Yang Hui type magic square with t-powered sum if for each e =2, 3, … , t, the sum of the elements of the first n
会议
For a given sequence {zn}n≥0 of positive real numbers, {zn}n≥0 is said to be log-concave (or log-convex) if z2n ≥ zn-1zn+1 (or zn2 ≤ zn-1zn+1) for all n ≥
会议
For any graph G, G together with sufficiently many isolated vertices is the competition graph of some acyclic digraph.The competition number k(G) of a graph G i
会议
Let G be a simple undirected graph with n vertices.A stable set of a graph G is a set of vertices no two of which are adjacent.The cardinality of a maximum stab
会议
Gyárfás conjectured that for every tree T, there exists an integer-valued function fT(x) such that every graph G of chromatic number larger than fT(ω(G)) con
会议