f-COLORINGS OF SOME COMPLETE TRIPARTITE GRAPHS
An f-coloring of G is an edge coloring of G such that each v ∈ V incidences with at most f(v) same-colored edges. The f-chromatic index of G is the minimum number of colors used for an f-coloring of G. A graph can be specified into the class Cf1 or Cf2 based on its f-chromatic index. In th...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/16546 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |