The Tight Bound for the Strong Chromatic Indices of Claw-Free Subcubic Graphs-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

The Tight Bound for the Strong Chromatic Indices of Claw-Free Subcubic Graphs

Published:2023-05 Issue:3 Volume:39 Page:
ISSN:0911-0119
Container-title:Graphs and Combinatorics
language:en
Short-container-title:Graphs and Combinatorics

Author:

Lin Yuquan,Lin Wensong^ORCID

Funder

National Natural Science Foundation of China

Publisher

Springer Science and Business Media LLC

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Link

https://link.springer.com/content/pdf/10.1007/s00373-023-02655-7.pdf

Reference24 articles.

1. Andersen, L.D.: The strong chromatic index of a cubic graph is at most 10. Discret. Math. 108, 231–252 (1992)

2. Bensmail, J., Bonamy, M., Hocquard, H.: Strong edge coloring sparse graphs. Electron. Notes Discret. Math. 49, 773–778 (2015)

3. Bonamy, M., Perrett, T., Postle, L.: Colouring graphs with sparse neighbourhoods: bounds and applications. J. Comb. Theory Ser. B 155, 278–317 (2022)

4. Bruhn, H., Joos, F.: A stronger bound for the strong chromatic index. Electron. Notes Discret. Math. 49, 277–284 (2015)

5. Cranston, D.W.: Strong edge-coloring of graphs with maximum degree 4 using 22 colors. Discret. Math. 306(21), 2772–2778 (2006)

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A note on strong edge-coloring of claw-free cubic graphs;Journal of Applied Mathematics and Computing;2023-02-26

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3