List strong edge coloring of planar graphs with maximum degree 4
type: Item
instance of: scholarly article
title: List strong edge coloring of planar graphs with maximum degree 4
zbMATH Open document ID: 1407.05065
author: Ming Chen
author: Jie Hu
author: Xiaowei Yu
author: Shan Zhou
published in: Discrete Mathematics
publication date: 2019-03-25T00:00:00Z
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 7041401
zbMATH Keywords: planar graph
zbMATH Keywords: strong choice number
zbMATH Keywords: Hall's theorem
MaRDI profile type: Publication
full work available at URL: j.disc.2018.10.034
OpenAlex ID: W2915216917
cites work: The strong chromatic index of a cubic graph is at most 10
cites work: Strong edge-coloring of graphs with maximum degree 4 using 22 colors
cites work: Strong list-chromatic index of subcubic graphs
cites work: Problems and results in combinatorial analysis and graph theory
cites work: Q5752590
cites work: Q3320410
cites work: Induced matchings in cubic graphs
cites work: Strong chromatic index of graphs with maximum degree four
cites work: A bound on the strong chromatic index of a graph
cites work: Planar graphs with maximum degree 4 are strongly 19-edge-colorable
Wikidata QID: Q128363332
DOI: 10.1016/J.DISC.2018.10.034
description: scientific article; zbMATH DE number 7041401