On strong edge-coloring of graphs with maximum degree 4
type: Item
instance of: scholarly article
title: On strong edge-coloring of graphs with maximum degree 4
zbMATH Open document ID: 1375.05099
author: Jianbo Lv
author: Xiangwen Li
author: Gexin Yu
published in: Discrete Applied Mathematics
publication date: 2017-12-06T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C07
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C42
zbMATH DE Number: 6815849
zbMATH Keywords: strong edge-coloring
zbMATH Keywords: strong chromatic index
zbMATH Keywords: maximum average degree
zbMATH Keywords: sparse graphs
MaRDI profile type: Publication
full work available at URL: j.dam.2017.09.006
OpenAlex ID: W2917098087
cites work: The strong chromatic index of a cubic graph is at most 10
cites work: Strong edge coloring sparse graphs
cites work: A stronger bound for the strong chromatic index (extended abstract)
cites work: Strong edge-coloring of graphs with maximum degree 4 using 22 colors
cites work: On the strong chromatic index of sparse graphs
cites work: Problems and results in combinatorial analysis and graph theory
cites work: Q3320410
cites work: Q3216671
cites work: On strong edge-colouring of subcubic graphs
cites work: Strong edge colouring of subcubic graphs
cites work: Induced matchings in cubic graphs
DOI: 10.1016/J.DAM.2017.09.006
description: scientific article; zbMATH DE number 6815849