Edge incident 2-edge coloring of graphs

Title

Edge incident 2-edge coloring of graphs

Creator

Joseph A.; Dominic C.

Description

The edge incident 2-edge coloring of a graph G is an edge coloring of the graph G such that not more than two colors are assigned to the edges incident to an edge e = uv in G. In other words, for every edge e in G, the edge e and all the edges that are incident to the edge e is in at most two different color classes. The edge incident 2-edge coloring number ?n2(G) is the maximum number of colors in any edge incident 2-edge coloring of G. The main objective of this paper is to study the edge incident 2-edge coloring concept and apply the same to some graph classes. Besides finding the exact values of these parameters, we also obtain some bounds. World Scientific Publishing Company.

Source

Discrete Mathematics, Algorithms and Applications

Date

2024-01-01

Publisher

World Scientific

Subject

Edge incident 2-edge coloring; edge incident 2-edge coloring number

Coverage

Joseph A., Department of Mathematics, CHRIST (Deemed to be University), Karnataka, Bangalore, 560029, India; Dominic C., Department of Mathematics, CHRIST (Deemed to be University), Karnataka, Bangalore, 560029, India

Rights

Restricted Access

Relation

ISSN: 17938309

Format

Online

Language

English

Type

Article

Identifier

https://doi.org/10.1142/S179383092450040X

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85192953734&doi=10.1142%2fS179383092450040X&partnerID=40&md5=0a17f4c4ffa65f5343b8f39b47667d3c