THE 4-RAINBOW INDEX OF CM + PN
Let G be a simple and connected graph of order n with an h-edge coloring c : E(G) ! f1; 2; : : : ; hg for some h 2 N, where adjacent edges may be colored the same. A tree T in G is called a rainbow tree, if no two edges of T have the same color. An h-edge coloring of G is called a k-rainbow h-edg...
Saved in:
| Main Author: | |
|---|---|
| Format: | Theses |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/61244 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |