版权说明 操作指南
首页 > 成果 > 详情

Planar graphs without 5-cycles and intersecting triangles are (1,1,0)-colorable

认领
导出
Link by 万方学术期刊
反馈
分享
QQ微信 微博
成果类型:
期刊论文
作者:
Liu, Runrun;Li, Xiangwen;Yu, Gexin*
通讯作者:
Yu, Gexin
作者机构:
[Liu, Runrun; Yu, Gexin; Li, Xiangwen] Huazhong Normal Univ, Dept Math, Wuhan 430079, Peoples R China.
[Yu, Gexin] Coll William & Mary, Dept Math, Williamsburg, VA 23185 USA.
通讯机构:
[Yu, Gexin] C
Coll William & Mary, Dept Math, Williamsburg, VA 23185 USA.
语种:
英文
关键词:
Relaxed-coloring;Planar graphs;Steinberg Conjecture;Bordeaux Conjecture
期刊:
Discrete Mathematics
ISSN:
0012-365X
年:
2016
卷:
339
期:
2
页码:
992-1003
基金类别:
The second author was supported by the Natural Science Foundation of China ( 11171129 ) and by Doctoral Fund of Ministry of Education of China ( 20130144110001 ); The third author’s research was supported in part by NSA grant H98230-12-1-0226 .
机构署名:
本校为第一机构
院系归属:
数学与统计学学院
摘要:
A (c(1), c(2), ... , c(k))-coloring of G is a mapping phi : V(G) over right arrow {1, 2, ... , k} such that for every i, 1

反馈

验证码:
看不清楚,换一个
确定
取消

成果认领

标题:
用户 作者 通讯作者
请选择
请选择
确定
取消

提示

该栏目需要登录且有访问权限才可以访问

如果您有访问权限,请直接 登录访问

如果您没有访问权限,请联系管理员申请开通

管理员联系邮箱:yun@hnwdkj.com