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

On strong edge-coloring of graphs with maximum degree 4

认领
导出
Link by 万方学术期刊
反馈
分享
QQ微信 微博
成果类型:
期刊论文
作者:
Lv, Jian-Bo;Li, Xiangwen*;Yu, Gexin
通讯作者:
Li, Xiangwen
作者机构:
[Yu, Gexin; Li, Xiangwen; Lv, Jian-Bo] Cent China Normal Univ, Sch Math & Stat, Wuhan 430079, Hubei, Peoples R China.
[Yu, Gexin] Coll William & Mary, Dept Math, Williamsburg, VA 23185 USA.
通讯机构:
[Li, Xiangwen] C
Cent China Normal Univ, Sch Math & Stat, Wuhan 430079, Hubei, Peoples R China.
语种:
英文
关键词:
Strong edge-coloring;Strong chromatic index;Maximum average degree;Sparse graphs
期刊:
Discrete Applied Mathematics
ISSN:
0166-218X
年:
2018
卷:
235
页码:
142-153
基金类别:
The authors would like to thank the referees for the valuable comments and suggestions which leadto improve the representation. The second author was supported by NSF of China ( 11571134 ). The third author was supported by NSA grant H98230-16-1-0316 .
机构署名:
本校为第一且通讯机构
院系归属:
数学与统计学学院
摘要:
The strong chromatic index of a graph G, denoted by χs′(G), is the least number of colors needed to edge-color G properly so that every path of length 3 uses three different colors. In this paper, we prove that if G is a graph with Δ(G)=4 and maximum average degree less than [Formula presented] (resp.[Formula presented], [Formula presented], [Formula presented], [Formula presented]), then χs′(G)≤16 (resp.17, 18, 19, 20), which improves the...

反馈

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

成果认领

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

提示

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

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

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

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