On strong edge-coloring of graphs with maximum degree 4

DOI10.1016/J.DAM.2017.09.006zbMath1375.05099OpenAlexW2917098087MaRDI QIDQ1682888

Jian-Bo Lv, Gexin Yu, Xiangwen Li

Publication date: 6 December 2017

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

Full work available at URL: https://doi.org/10.1016/j.dam.2017.09.006

zbMATH Keywords

sparse graphsstrong chromatic indexmaximum average degreestrong edge-coloring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07) Density (toughness, etc.) (05C42)

Related Items (7)

The tight bound for the strong chromatic indices of claw-free subcubic graphs ⋮ On strong edge-coloring of graphs with maximum degree 5 ⋮ Unnamed Item ⋮ Recent progress on strong edge-coloring of graphs ⋮ Strong edge-colorings of sparse graphs with \(3\Delta-1\) colors ⋮ Strong edge coloring of Cayley graphs and some product graphs ⋮ On strong edge-coloring of claw-free subcubic graphs

Cites Work

• Unnamed Item
• Unnamed Item
• A stronger bound for the strong chromatic index (extended abstract)
• Strong edge coloring sparse graphs
• Strong edge colouring of subcubic graphs
• Problems and results in combinatorial analysis and graph theory
• The strong chromatic index of a cubic graph is at most 10
• On the strong chromatic index of sparse graphs
• Strong edge-coloring of graphs with maximum degree 4 using 22 colors
• On strong edge-colouring of subcubic graphs
• Induced matchings in cubic graphs

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