On strong edge-coloring of graphs with maximum degree 5

DOI10.1016/j.dam.2023.11.023MaRDI QIDQ6180572

Xiaolan Hu, Jian Lu, Huiqing Liu

Publication date: 22 December 2023

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

zbMATH Keywords

strong chromatic indexmaximum average degreestrong edge-coloring

Mathematics Subject Classification ID

Graph theory (05Cxx) Combinatorics (05-XX) General and miscellaneous specific topics (00Axx)

Cites Work

• Unnamed Item
• A stronger bound for the strong chromatic index (extended abstract)
• Problems and results in combinatorial analysis and graph theory
• 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
• On strong edge-coloring of graphs with maximum degree 4
• Strong edge coloring of Cayley graphs and some product graphs
• On strong edge-coloring of claw-free subcubic graphs
• Strong edge-coloring of cubic bipartite graphs: a counterexample
• Strong edge-coloring of graphs with maximum degree 4 using 22 colors
• Combinatorial Nullstellensatz
• Induced matchings in cubic graphs
• Recent progress on strong edge-coloring of graphs
• Strong edge colorings of graphs and the covers of Kneser graphs

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