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:
| 主要作者: | |
|---|---|
| 格式: | Final Project |
| 語言: | Indonesia |
| 在線閱讀: | https://digilib.itb.ac.id/gdl/view/16546 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 總結: | 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 this final project, we consider the f-colorings on tripartite graphs which are graphs with the set of vertex can be partitioned into three subsets so that no two neighboring vertices in the same subset. The results obtained are the characterization of a subclass of tripartite graphs with certain f function based on their f-chromatic index. |
|---|