共 50 条
Coloring clique-hypergraphs of graphs with no subdivision of K5
被引:0
|作者:
Shan, Erfang
[1
,2
]
Kang, Liying
[2
]
机构:
[1] School of Management, Shanghai University, Shanghai,200444, China
[2] Department of Mathematics, Shanghai University, Shanghai,200444, China
基金:
中国国家自然科学基金;
关键词:
Chromatic number - Free graphs - Hyperedges - Hypergraph - Maximal clique - Odd cycle - Planar graph - Polynomial-time algorithms;
D O I:
暂无
中图分类号:
学科分类号:
摘要:
引用
收藏
页码:166 / 175
相关论文