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 |
| id |
id-itb.:16546 |
|---|---|
| spelling |
id-itb.:165462017-09-27T11:43:00Zf-COLORINGS OF SOME COMPLETE TRIPARTITE GRAPHS DENDI RADITYA BAKRY (NIM : 10108100); Pembimbing : Prof. Dr. M. Salman A. N., MUHAMMAD Indonesia Final Project INSTITUT TEKNOLOGI BANDUNG 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. text |
| institution |
Institut Teknologi Bandung |
| building |
Institut Teknologi Bandung Library |
| continent |
Asia |
| country |
Indonesia Indonesia |
| content_provider |
Institut Teknologi Bandung |
| collection |
Digital ITB |
| language |
Indonesia |
| description |
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. |
| format |
Final Project |
| author |
DENDI RADITYA BAKRY (NIM : 10108100); Pembimbing : Prof. Dr. M. Salman A. N., MUHAMMAD |
| spellingShingle |
DENDI RADITYA BAKRY (NIM : 10108100); Pembimbing : Prof. Dr. M. Salman A. N., MUHAMMAD f-COLORINGS OF SOME COMPLETE TRIPARTITE GRAPHS |
| author_facet |
DENDI RADITYA BAKRY (NIM : 10108100); Pembimbing : Prof. Dr. M. Salman A. N., MUHAMMAD |
| author_sort |
DENDI RADITYA BAKRY (NIM : 10108100); Pembimbing : Prof. Dr. M. Salman A. N., MUHAMMAD |
| title |
f-COLORINGS OF SOME COMPLETE TRIPARTITE GRAPHS |
| title_short |
f-COLORINGS OF SOME COMPLETE TRIPARTITE GRAPHS |
| title_full |
f-COLORINGS OF SOME COMPLETE TRIPARTITE GRAPHS |
| title_fullStr |
f-COLORINGS OF SOME COMPLETE TRIPARTITE GRAPHS |
| title_full_unstemmed |
f-COLORINGS OF SOME COMPLETE TRIPARTITE GRAPHS |
| title_sort |
f-colorings of some complete tripartite graphs |
| url |
https://digilib.itb.ac.id/gdl/view/16546 |
| _version_ |
1820745402103627776 |