The Rainbow Connection Number of Some Graph Classes
All graphs considered in this thesis are connected, finite, and simple. Let G = (V (G),E(G)) be a nontrivial connected graph and m be a positive integer. Let c : E(G) → {1,2,...,m} be an m−coloring of the edges of G. A path P in G is called a rainbow path, if no two edg...
Saved in:
| Main Author: | |
|---|---|
| Format: | Theses |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/22630 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |