On strong edge-coloring of graphs with maximum degree 5

DOI10.1016/J.DAM.2023.11.023MaRDI QIDQ6180572FDOQ6180572

Authors: Jian Lu, Huiqing Liu, Xiaolan Hu 

Publication date: 22 December 2023

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

Recommendations

• Strong edge-coloring of some sparse graphs
• Strong edge coloring sparse graphs
• Strong edge-colorings of sparse graphs with \(3\Delta-1\) colors
• Strong chromatic index of graphs with maximum degree four
• Strong edge-coloring of graphs with maximum degree 4 using 22 colors

zbMATH Keywords

strong chromatic indexstrong edge-coloringmaximum average degree

Mathematics Subject Classification ID

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

Cites Work

• A bound on the strong chromatic index of a graph
• Combinatorial Nullstellensatz
• Problems and results in combinatorial analysis and graph theory
• The strong chromatic index of a cubic graph is at most 10
• Strong edge-coloring of graphs with maximum degree 4 using 22 colors
• Induced matchings in cubic graphs
• A stronger bound for the strong chromatic index (extended abstract)
• Title not available (Why is that?)
• Strong chromatic index of graphs with maximum degree four
• Strong edge coloring of Cayley graphs and some product graphs
• Recent progress on strong edge-coloring of graphs
• On strong edge-coloring of graphs with maximum degree 4
• On strong edge-coloring of claw-free subcubic graphs
• Strong edge-coloring of cubic bipartite graphs: a counterexample
• Strong edge colorings of graphs and the covers of Kneser graphs

Cited In (1)

• Strong edge-coloring of some sparse graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6180572)