【摘 要】
：
In this talk,we shall introduce some results on judicious k-partitions of graphs,which improve the main results of [B,Xu,X.Yu,Better bounds for k-partitions
【机 构】
：
SouthChinaAgriculturalUniversity,Guangzhou,Guangdong,P.R.China
【出 处】
：
第六届图论与组合算法国际研讨会(The 6th International Symposium on Graph The
论文部分内容阅读
In this talk,we shall introduce some results on judicious k-partitions of graphs,which improve the main results of [B,Xu,X.Yu,Better bounds for k-partitions of graphs,Combin.Probab.Comput.20(2011)631{640],and [G.Fan,J.Hou,Q.Zeng,A bound for judicious k-partitions of graphs,Discrete Appl.Math.179(2014)86-99].
其他文献
A total-k-adjacent vertex distinguishing-coloring of G is a(proper)total-k-coloring of G such that any pair of adjacent vertices have distinct sets of color
In this paper,we propose a novel approach based on nonlocal means,total variation-regularization and sparse coding.Firstly,LR image is denoised by using non
For two given graphs G1 and G2,the planar Ramsey number PR(G1;G2)is the smallest integer N such that every planar graph G on N vertices,either G contains G1
A total-[k]-coloring of a graph G is a mappingφ:V(G)∪E(G)→ {1,2,…,k} such that any two adjacent elements in V(G)∪E(G)receive di erent colors.
A graph G is hypohamiltonian if it is not Hamiltonian but for each v∈V(G),G-v is Hamiltonian.A graph is supereulerian if it has a spanning Eulerian subgrap
Let G be a 2-edge-connected simple graph on n≥14 vetices,and let A denote an abelian group with the identity element 0.If a graph G* is obtained by repeate
Interconnection network is important for parallel processing which have been developed on cycle-embedding or path-embedding.Since failure may occur when a n
Pólyas problem concerns the conversion of the permanent and determinant of a matrix.As a generalization of this problem,this topic focus on the conversion
Given a graph H,what is the maximum number of edges of a graph with n vertices not containing H as a subgraph? This number is denoted ex(n,H),and is known a
Let A1,…,Ak be families of distinct subsets of [n].These families are incomparable if no set in one family is contained in a set in another family.A family