List strong edge-coloring of graphs with maximum degree 4

DOI10.1016/j.disc.2020.111854zbMath1437.05083arXiv1801.06758OpenAlexW3008559746MaRDI QIDQ2174601

Jie Hu, Yu-Lin Chang, Donglei Yang, Meijie Ma, Baochen Zhang

Publication date: 21 April 2020

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1801.06758

zbMATH Keywords

combinatorial nullstellensatzHall's theoremlist strong edge-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Unnamed Item ⋮ Strong list-chromatic index of planar graphs with Ore-degree at most seven ⋮ List strong edge-colorings of sparse graphs

Cites Work

• Strong edge-colorings for \(k\)-degenerate graphs
• Problems and results in combinatorial analysis and graph theory
• The strong chromatic index of a cubic graph is at most 10
• Strong chromatic index of graphs with maximum degree four
• Strong list-chromatic index of subcubic graphs
• Strong chromatic index of \(k\)-degenerate graphs
• Colouring graphs with sparse neighbourhoods: bounds and applications
• Strong edge-coloring of graphs with maximum degree 4 using 22 colors
• Strong Chromatic Index of Sparse Graphs
• Combinatorial Nullstellensatz
• Induced matchings in cubic graphs

This page was built for publication: List strong edge-coloring of graphs with maximum degree 4