Edge covering coloring of cartesian product and compositions of graphs
An edge coloring of a graph G is called an edge covering coloring if each color appears at each vertex at least once. The maximum positive integer k such that G has an edge covering coloring with k colors is called the edge covering chromatic index of G and is denoted by 0 c(G). A result from Gupta...
Saved in:
| Main Author: | |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Animo Repository
2016
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/etd_masteral/5460 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Language: | English |