Local edge coloring of graphs
Let be a graph. A local edge coloring of G is a proper edge coloring such that for each subset S of E(G) with there exist edges such that where ns is the number of copies of P3 in the edge induced subgraph The maximum color assigned by a local edge coloring c to an edge of G is called the value of c...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2021-01-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1080/09728600.2021.1915722 |
| id |
doaj-5a18c7b02edf487b8407f3d78045bcec |
|---|---|
| record_format |
Article |
| spelling |
doaj-5a18c7b02edf487b8407f3d78045bcec2021-07-06T11:30:09ZengTaylor & Francis GroupAKCE International Journal of Graphs and Combinatorics0972-86002543-34742021-01-01181293210.1080/09728600.2021.19157221915722Local edge coloring of graphsP. Deepa0P. Srinivasan1M. Sundarakannan2Department of Mathematics (SFS), Madras Christian CollegeDepartment of Mathematics, The American CollegeDepartment of Mathematics, Sri Sivasubramaniya Nadar College of EngineeringLet be a graph. A local edge coloring of G is a proper edge coloring such that for each subset S of E(G) with there exist edges such that where ns is the number of copies of P3 in the edge induced subgraph The maximum color assigned by a local edge coloring c to an edge of G is called the value of c and is denoted by The local edge chromatic number of G is where the minimum is taken over all local edge colorings c of G. In this article, we derive bounds and many results based on local edge coloring.http://dx.doi.org/10.1080/09728600.2021.1915722coloringedge coloringlocal coloringline graph |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
P. Deepa P. Srinivasan M. Sundarakannan |
| spellingShingle |
P. Deepa P. Srinivasan M. Sundarakannan Local edge coloring of graphs AKCE International Journal of Graphs and Combinatorics coloring edge coloring local coloring line graph |
| author_facet |
P. Deepa P. Srinivasan M. Sundarakannan |
| author_sort |
P. Deepa |
| title |
Local edge coloring of graphs |
| title_short |
Local edge coloring of graphs |
| title_full |
Local edge coloring of graphs |
| title_fullStr |
Local edge coloring of graphs |
| title_full_unstemmed |
Local edge coloring of graphs |
| title_sort |
local edge coloring of graphs |
| publisher |
Taylor & Francis Group |
| series |
AKCE International Journal of Graphs and Combinatorics |
| issn |
0972-8600 2543-3474 |
| publishDate |
2021-01-01 |
| description |
Let be a graph. A local edge coloring of G is a proper edge coloring such that for each subset S of E(G) with there exist edges such that where ns is the number of copies of P3 in the edge induced subgraph The maximum color assigned by a local edge coloring c to an edge of G is called the value of c and is denoted by The local edge chromatic number of G is where the minimum is taken over all local edge colorings c of G. In this article, we derive bounds and many results based on local edge coloring. |
| topic |
coloring edge coloring local coloring line graph |
| url |
http://dx.doi.org/10.1080/09728600.2021.1915722 |
| work_keys_str_mv |
AT pdeepa localedgecoloringofgraphs AT psrinivasan localedgecoloringofgraphs AT msundarakannan localedgecoloringofgraphs |
| _version_ |
1721317643877613568 |