THE RIGID 3-RAINBOW COLORING OF SOME GRAPHS
Let ???? be a simple, connected, and finite graph with order ?????3 and has an edge coloring. A path ???? in ???? is called a rainbow path if every edge in ???? has a different color. For a set ?????????(????), a Steiner path ???? is the shortest path that contains ????. A rigid 3-strong rainbow col...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/87962 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |