Strong list-chromatic index of planar graphs with Ore-degree at most seven
From MaRDI portal
Publication:6083189
DOI10.1007/s00373-023-02714-zOpenAlexW4387458395MaRDI QIDQ6083189
Mingfang Huang, Guorong Liu, Xiangqian Zhou
Publication date: 31 October 2023
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-023-02714-z
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On strong list edge coloring of subcubic graphs
- Strong list edge coloring of subcubic graphs
- The strong chromatic index of a class of graphs
- The strong chromatic index of a cubic graph is at most 10
- A bound on the strong chromatic index of a graph
- Strong chromatic index of graphs with maximum degree four
- List strong edge coloring of planar graphs with maximum degree 4
- Planar graphs with maximum degree 4 are strongly 19-edge-colorable
- Strong list-chromatic index of subcubic graphs
- Colouring graphs with sparse neighbourhoods: bounds and applications
- List strong edge-coloring of graphs with maximum degree 4
- The strong edge-coloring for graphs with small edge weight
- Induced matchings in cubic graphs