Search found 1 match
Search found 1 match • Page 1 of 1
- Wed Dec 26, 2012 11:16 am
- Forum: Volume 113 (11300-11399)
- Topic: 11307 - Alternative Arborescence
- Replies: 22
- Views: 10994
I'm confused about the statement of this problem.As I can see here in this thread,everyone solved this problem with more color than 2.But Problem says.. you will be given a tree (connected graph with no simple loops) There will be no simple loop and will be connected and we also know a tree must ha...