Recent progress on strong edge-coloring of graphs-Reference-Cited by-同舟云学术

Recent progress on strong edge-coloring of graphs

Published:2019-10 Issue:05 Volume:11 Page:1950062
ISSN:1793-8309
Container-title:Discrete Mathematics, Algorithms and Applications
language:en
Short-container-title:Discrete Math. Algorithm. Appl.

Author:

Deng Kecai¹,Yu Gexin²,Zhou Xiangqian³^ORCID

Affiliation:

1. Department of Mathematical Sciences, Huaqiao University, Xiamen, Fujian Province, P. R. China

2. Department of Mathematics, The College of William and Mary, Williamsburg 23185, Virginia, USA

3. Department of Mathematics and Statistics, Wright State University, Dayton 45435, Ohio, USA

Abstract

A strong edge-coloring of a graph [Formula: see text] is a partition of its edge set [Formula: see text] into induced matchings. In this paper, we gave a short survey on recent results about strong edge-coloring of a graph.

Funder

National Security Agency

Publisher

World Scientific Pub Co Pte Lt

Subject

Discrete Mathematics and Combinatorics

Link

https://www.worldscientific.com/doi/pdf/10.1142/S1793830919500629

Reference71 articles.

1. The strong chromatic index of a cubic graph is at most 10

2. Strong edge coloring sparse graphs

3. Strong edge-colouring of sparse planar graphs

4. Strong edge-coloring of (3,Δ)-bipartite graphs

5. Precise upper bound for the strong edge chromatic number of sparse planar graphs

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

1. On strong edge-coloring of graphs with maximum degree 5;Discrete Applied Mathematics;2024-02

2. Strongly Proper Connected Coloring of Graphs;Annals of Combinatorics;2023-11-24

3. Strong edge-coloring of 2-degenerate graphs;Discrete Applied Mathematics;2023-09

4. A Survey on Algorithmic Problems in Wireless Systems;Proceedings of the 12th International Conference on Sensor Networks;2023

5. Strong edge-coloring of cubic bipartite graphs: A counterexample;Discrete Applied Mathematics;2022-11