Edge-partition and star chromatic index

Yiqiao Wang, Weifan Wang and Ying Wang

Applied Mathematics and Computation, 2018, vol. 333, issue C, 480-489

Abstract: The star chromatic index χst′(G) of a graph G is the smallest integer k for which G has a proper edge k-coloring without bichromatic paths or cycles of length four. The strong chromatic index χs′(G) of G is the smallest integer k for which G has a proper edge k-coloring such that any two edges at distance at most two get distinct colors.

Keywords: Star chromatic index; Strong chromatic index; Planar graph; Outerplanar graph; Edge-partition (search for similar items in EconPapers)
Date: 2018
References: View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300318302601
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:333:y:2018:i:c:p:480-489

DOI: 10.1016/j.amc.2018.03.079

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