Injective edge coloring of generalized Petersen graphs

Three edges $ e_1 $, $ e_2 $ and $ e_3 $ in a graph $ G $ are $ consecutive $ if they form a cycle of length $ 3 $ or a path in this order. A $ k $-$ injective\; edge\; coloring $ of a graph $ G $ is an edge coloring of $ G $, (not necessarily proper), such that if edges $ e_1 $, $ e_2 $, $ e_3 $ ar...

Full description

Bibliographic Details
Main Authors: Yanyi Li, Lily Chen
Format: Article
Language:English
Published: AIMS Press 2021-05-01
Series:AIMS Mathematics
Subjects:
Online Access:http://www.aimspress.com/article/doi/10.3934/math.2021460?viewType=HTML