THE MINIMAL SIZE OF RAINBOW 3-CONNECTED GRAPH
All graph considered in this thesis are simple,unite, undirected, and nontrivial.Let r 2 N, n 2 N, and G = (V (G);E(G)) be a r-connected on n vertices. Function c : E(G) ! [1; k] is said a rainbow k-edge coloring on G, if any two vertices u and v there exists a u v path with all edges have differen...
Saved in:
| Main Author: | |
|---|---|
| Format: | Theses |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/20860 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |