An upper bound for the choice number of star edge coloring of graphs

Jiansheng Cai, Chunhua Yang and Jiguo Yu

Applied Mathematics and Computation, 2019, vol. 348, issue C, 588-593

Abstract: The star chromatic index of a multigraph G, denoted χs′(G), is the minimum number of colors needed to properly color the edges of G such that no path or cycle of length four is bi-colored. A multigraph G is star k-edge-colorable if χs′(G)≤k. Dvořák et al. (2013) proved that every subcubic multigraph is star 7-edge-colorable. They conjectured in the same paper that every subcubic multigraph should be star 6-edge-colorable. In this paper, we consider this problem in a more general setting, we investigate star list edge coloring of general graph G and obtain an upper bound for the choice number of star edge coloring of graphs, namely, we proved that χsl′≤⌈2Δ32(1Δ+2)12+2Δ⌉.

Keywords: Star edge coloring; Choice number; Star chromatic index; Entropy compression (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300318310634
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:348:y:2019:i:c:p:588-593

DOI: 10.1016/j.amc.2018.12.016

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().