A Linear-time Algorithm for Clique-coloring Problem in Circular-arc Graphs

来源 :第六届图论与组合算法国际研讨会(The 6th International Symposium on Graph The | 被引量 : 0次 | 上传用户：wynfloodforce

【摘要】

：

　　A k-clique-coloring of a graph G is an assignment of k colors to the vertices of G such that no maximal clique with at least two vertices is monochromatic.

【作者】

：

Erfang Shan

【机构】

：

DepartmentofMathematics,ShanghaiUniversity,Shanghai200444,P.R.China

【出处】

：

第六届图论与组合算法国际研讨会(The 6th International Symposium on Graph The

【发表日期】

：

2015年7期

下载到本地 , 更方便阅读

下载此文赞助VIP

声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架

论文部分内容阅读

　　A k-clique-coloring of a graph G is an assignment of k colors to the vertices of G such that no maximal clique with at least two vertices is monochromatic.

其他文献

Copositivity Detection of Higher-order Tensors and Applications

Outline ·Basic definitions and notations·Motivation·Criteria based on standard simplex·Algorithms·Extensions for copositive rectangular tensors·Numerical

会议

Convergence rate of HOPM for the best rank one approximation of a real tensor

参考论文 convergence results papers L.Wang,M.Chu:On the global convergence of the alternating least squares method for rank-one approximation to generic tensors

会议

Time Consistent Multi-period Robust Risk Measures and Portfolio Selection Models

Contents(1) Introduction(2) Multi-period worst-case risk measure(3) Multi-period worst-case risk measure with regime switching(4) Empirical results(5) Conclusio

会议

面向公平性和收益性的医疗资源配置优化

医疗与健康服务体系是公共卫生、医疗、医保和药品保障的统一体，涉及国计民生重大的问题！本文分析了考虑公平性和收益性的影像设备资源优化配置、平衡公平性和收益性多目标病房

会议

医疗资源优化配置公平性收益性

Orthogonal Arrays

Outline ·Introduction;·Constructions of Orthogonal Arrays;·Augmented Orthogonal Arrays;·All or nothing transform

会议

不完整信息下的复杂网络分析--面向赛博作战

分析了不完整信息下赛博作战的复杂网络。赛博空间:第四次世界大战爆发的触点?第一枪赛博战最令人恐惧的地方就是具有针对性:敌人可以跨越国界攻击一个人、一类人、甚至一个

会议

复杂网络拓扑结构不完整信息目标选择

EKR Theorem and Independent Sets of Vertex-Transitive Graphs

　　The original EKR(Erd(o)s-Ko-Rado)theorem describes the size and structure of the largest collection of intersecting k-subsets of the set [n]={1,2,…,n}.

会议

Combinatorial Search Problems

　　In many fields of human activity we have to find an unknown object with as little cost as possible.A mathematical model of such problems and first general r

会议

Some Problems on Ramsey Numbers

　　For two given graphs G and H,the Ramsey number R(G,H)is the smallest integer N such that any red-blue edge colorings of a complete graph Kn,either there is

会议

Double Happiness for Edge-bicolored Graphs

　　Let G be an edge-bicolored graph where each edge is colored either blue or red.We discuss problems of obtaining a subgraph H from G that simultaneously sati

会议

A Linear-time Algorithm for Clique-coloring Problem in Circular-arc Graphs

其他学术论文