The Strong Edge-Coloring of Graphs

Authors

Xiangqian Zhou, Wright State University

Document Type

Lecture

Publication Date

11-11-2024

Abstract

A proper edge-coloring of a graph G is called a strong edge-coloring if any two edges joined by another edge receive distinct colors. It is clear that in a strong edge-coloring, every color class forms an induced matching. In this talk, we will give a survey on the strong edge-colorings of several classes of sparse graphs, including graphs with small maximum degree, bipartite graphs, and planar graphs.

Relational Format

presentation

Recommended Citation

Zhou, Xiangqian, "The Strong Edge-Coloring of Graphs" (2024). Combinatorics Seminar. 7.
https://egrove.olemiss.edu/math_combinatorics/7