BSc CS sem 3 Combinatorics and Graph Theory Practical solution Download




List of Practicals

1. Solving problems on strings, sets and binomial coefficients.


2. Solving problems using induction.


3. Solving problems on Eulerian and Hamiltonian graphs.


4. Solving problems on Chromatic number and coloring


5. Solving problems using Kruskal’s Algorithm


6. Solving problems using Prim’s Algorithm


7. Solving problems using Dijkstra’s Algorithm


8. Solving problems of finding augmenting paths in network flows.


9. Solving problems on network flows using Ford-Fulkerson Labeling Algorithm


10. Solving problems on posets and their associated networks.