Star Edge Coloring of Some Classes of Graphs

A star edge coloring of a graph is a proper edge coloring without bichromatic paths and cycles of length four. In this article, we establish tight upper bounds for trees and subcubic outerplanar graphs, and derive an upper bound for outerplanar graphs.

Saved in:
Bibliographic Details
Published in:Journal of graph theory 2016-01, Vol.81 (1), p.73-82
Main Authors: Bezegova, udmila, Luzar, Borut, Mockovciakova, Martina, Sotak, Roman, Skrekovski, Riste
Format: Article
Language:English
Subjects:
Graphs
star chromatic index
star edge coloring
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A star edge coloring of a graph is a proper edge coloring without bichromatic paths and cycles of length four. In this article, we establish tight upper bounds for trees and subcubic outerplanar graphs, and derive an upper bound for outerplanar graphs.
ISSN:0364-9024
1097-0118
DOI:10.1002/jgt.21862