Strong List-Chromatic Index of Planar Graphs with Ore-Degree at Most Seven

Authors

Mingfang Huang, Wuhan University of Technology
Guorong Liu, Huaqiao University
Xiangqian Zhou, Wright State University - Main CampusFollow

Document Type

Article

Publication Date

12-1-2023

Identifier/URL

41018084 (Pure)

Abstract

A strong edge-coloring of a graph G = (V , E) is a partition of its edge set E into induced matchings. The Ore-degree of a graph G is defined to be max { d G (u) + d G (v) | u v ∈ E (G) } . In this article, we study the list version of strong edge-colorings and we show that every planar graph with Ore-degree at most 7 has strong list-chromatic index at most 14.

Comments

Publisher Copyright: © 2023, The Author(s), under exclusive licence to Springer Nature Japan KK, part of Springer Nature.

Repository Citation

Huang, M., Liu, G., & Zhou, X. (2023). Strong List-Chromatic Index of Planar Graphs with Ore-Degree at Most Seven. Graphs and Combinatorics, 39 (6).
https://corescholar.libraries.wright.edu/math/486

DOI

10.1007/s00373-023-02714-z