Injective edge coloring of sparse graphs-Reference-Cited by-同舟云学术

Injective edge coloring of sparse graphs

Published:2018-04 Issue:02 Volume:10 Page:1850022
ISSN:1793-8309
Container-title:Discrete Mathematics, Algorithms and Applications
language:en
Short-container-title:Discrete Math. Algorithm. Appl.

Author:

Bu Yuehua¹²,Qi Chentao¹

Affiliation:

1. Department of Mathematics, Zhejiang Normal University, Jinhua 321004, P. R. China

2. Xingzhi College, Zhejiang Normal University, Jinhua 321004, P. R. China

Abstract

A [Formula: see text]-injective edge coloring of a graph [Formula: see text] is a coloring [Formula: see text], such that if [Formula: see text], [Formula: see text] and [Formula: see text] are consecutive edges in [Formula: see text], then [Formula: see text]. [Formula: see text] has a [Formula: see text]-injective edge coloring[Formula: see text] is called the injective edge coloring number. In this paper, we consider the upper bound of [Formula: see text] in terms of the maximum average degree mad[Formula: see text], where [Formula: see text].

Publisher

World Scientific Pub Co Pte Lt

Subject

Discrete Mathematics and Combinatorics

Link

https://www.worldscientific.com/doi/pdf/10.1142/S1793830918500222

Reference2 articles.

1. Injective (Δ + 1)-coloring of planar graphs with girth 6

2. On the injective chromatic number of graphs

Cited by 20 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On injective edge-coloring of graphs with maximum degree 4;Discrete Applied Mathematics;2025-01

2. Injective edge chromatic number of sparse graphs;Applied Mathematics and Computation;2024-07

3. Injective edge-coloring of claw-free subcubic graphs;Journal of Combinatorial Optimization;2024-07

4. Injective Chromatic Index of $$K_4$$-Minor Free Graphs;Graphs and Combinatorics;2024-06-04

5. Injective chromatic index of sparse graphs;Discrete Applied Mathematics;2024-03