Strong edge colouring of subcubic graphs
type: Item
instance of: scholarly article
title: Strong edge colouring of subcubic graphs
zbMATH Open document ID: 1228.05152
author: Hervé Hocquard
author: Petru Valicov
published in: Discrete Applied Mathematics
publication date: 2011-10-27T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 5964703
zbMATH Keywords: subcubic graphs
zbMATH Keywords: maximum average degree
zbMATH Keywords: strong edge colouring
MaRDI profile type: Publication
full work available at URL: j.dam.2011.06.015
OpenAlex ID: W1969425709
cites work: Induced matchings in bipartite graphs
cites work: Q5752590
cites work: The strong chromatic index ofC4-free graphs
DOI: 10.1016/J.DAM.2011.06.015
Recommended article: On strong edge-colouring of subcubic graphs
Recommended article: Strong edge-coloring of subcubic planar graphs
Recommended article: Bounds and complexity results for strong edge colouring of subcubic graphs
Recommended article: Between proper and strong edge‐colorings of subcubic graphs
Recommended article: Between Proper and Strong Edge-Colorings of Subcubic Graphs
Recommended article: Strong list edge coloring of subcubic graphs
Recommended article: Strong edge colorings of graphs
Recommended article: On strong list edge coloring of subcubic graphs
Recommended article: Q3216671
Recommended article: Strong edge-coloring for cubic Halin graphs
description: scientific article; zbMATH DE number 5964703