An upper bound for the choice number of star edge coloring of graphs
type: Item
instance of: scholarly article
title: An upper bound for the choice number of star edge coloring of graphs
zbMATH Open document ID: 1428.05097
author: Jiguo Yu
author: Jiansheng Cai
author: Chunhua Yang
published in: Applied Mathematics and Computation
publication date: 2019-11-26T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 7136829
zbMATH Keywords: star edge coloring
zbMATH Keywords: choice number
zbMATH Keywords: star chromatic index
zbMATH Keywords: entropy compression
MaRDI profile type: Publication
full work available at URL: j.amc.2018.12.016
OpenAlex ID: W2905740390
cites work: Coloring with no 2-colored \(P_4\)'s
cites work: Star Edge Coloring of Some Classes of Graphs
cites work: On the maximum average degree and the oriented chromatic number of a graph
cites work: Star coloring of sparse graphs
cites work: Improved upper bound for the degenerate and star chromatic numbers of graphs
cites work: 6-Star-Coloring of Subcubic Graphs
cites work: Star Chromatic Index
cites work: Acyclic edge-coloring using entropy compression
cites work: The NP-Completeness of Edge-Coloring
cites work: List star edge-coloring of subcubic graphs
cites work: Star coloring bipartite planar graphs
cites work: Star chromatic index of subcubic multigraphs
cites work: Star 5-edge-colorings of subcubic multigraphs
cites work: Q5322832
cites work: A constructive proof of the general lovász local lemma
cites work: Q5692719
cites work: Star chromatic index of subcubic graphs
cites work: Edge-partition and star chromatic index
cites work: Star edge-coloring of graphs with maximum degree four
DOI: 10.1016/J.AMC.2018.12.016
description: scientific article; zbMATH DE number 7136829