Star edge-coloring of graphs with maximum degree four

Ying Wang, Yiqiao Wang and Weifan Wang

Applied Mathematics and Computation, 2019, vol. 340, issue C, 268-275

Abstract: The star chromatic index χst′(G) of a graph G is the smallest integer k for which G has a proper k-edge-coloring without bichromatic paths or cycles of length four. In this paper, we prove that (1) if G is a graph with Δ=4, then χst′(G)≤14; and (2) if G is a bipartite graph with Δ=4, then χst′(G)≤13.

Keywords: Star edge-coloring; Star chromatic index; Maximum degree; Edge-partition (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300318307495
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:340:y:2019:i:c:p:268-275

DOI: 10.1016/j.amc.2018.08.035

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 ().