| 1 | Heuristic Algorithm For An Upper Bound | arrow_forward |
| 2 | Vertex Covering | arrow_forward |
| 3 | Types Of Enumeration | arrow_forward |
| 4 | Rooted Lebeled Tree | arrow_forward |
| 5 | Equivalance Classes Of Function | arrow_forward |
| 6 | Condensation, Reachability And Oreintable Graph | arrow_forward |
| 7 | Connected Digraphs | arrow_forward |
| 8 | Orientation Of A Graph | arrow_forward |
| 9 | Transversal Theory | arrow_forward |
| 10 | Group | arrow_forward |