Dublin Core The Dublin Core metadata element set is common to all Omeka records, including items, files, and collections. For more information see, http://dublincore.org/documents/dces/. Title A name given to the resource Faculty Publications Article Faculty Publications -Articles Dublin Core The Dublin Core metadata element set is common to all Omeka records, including items, files, and collections. For more information see, http://dublincore.org/documents/dces/. Creator An entity primarily responsible for making the resource Joseph, Anu; Dominic, Charles Title A name given to the resource Edge incident 2-edge coloring of graphs Date A point or period of time associated with an event in the lifecycle of the resource 01-01-2025 Source A related resource from which the described resource is derived Discrete Mathematics, Algorithms and Applications;Volume;17;Issue;3;Article No.;2450040; Identifier An unambiguous reference to the resource within a given context <a href="https://doi.org/10.1142/S179383092450040X" target="_blank" rel="noreferrer noopener">https://doi.org/10.1142/S179383092450040X</a> <br /><br /><a href="https://www.scopus.com/pages/publications/105003015614?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/105003015614?origin=resultslist</a> Coverage The spatial or temporal topic of the resource, the spatial applicability of the resource, or the jurisdiction under which the resource is relevant 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 Description An account of the resource 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 ?'ein2 (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. 2025 World Scientific Publishing Company. Subject The topic of the resource Edge incident 2-edge coloring; edge incident 2-edge coloring number Publisher An entity responsible for making the resource available World Scientific Relation A related resource ISSN: 17938309; Language A language of the resource English Type The nature or genre of the resource Article Rights Information about rights held in and over the resource Restricted Access; Hardcopy may be available in the library Format The file format, physical medium, or dimensions of the resource online