Course: CSC-333 Graph Theory (Major Assignment)

Section: B

Department: Computer Science

Note: Study at least one research paper and create a summary of it.

S. No. Reg Student Name Topics

No
1 10759 NUAMAN MISKEEN Bipartite graph

2 12508 IDREES Hamiltonian graphs

3 12516 MUHAMMAD HARIS AKHTAR Eulerian graphs
4 12532 MUHAMMAD ABDULLAH Counting trees
5 12560 AMIR IHSAN Planar graphs
6 12572 MUHAMMAD HASNAIN Ant colony algorithm
7 12580 FAKHAR UL HASSAN Incidence matrix
8 12602 MUHAMMAD ZAIN Infinite graphs
9 12623 MUHAMMAD ASIM Coloring vertices
10 12626 MUHAMMAD WAQAR Brooks' theorem
11 12640 AMMAR HANIF Colouring maps
12 12650 ZAID ALI Colouring edges of graph
13 12669 SHAHMIR KHAN Chromatic polynomials
14 12670 MUHAMMAD SAMEER ALI Markov chains
15 12688 JAVERIA CHANDNI Transversal theory
16 12734 HABIBULLAH KHAN Menger's theorem
17 12752 ABDUL HADI Network flow
18 12759 AHMAD KHURRAM TARIQ MA Matroids
19 12760 MUHAMMAD HASSAN JAN Dijkstra's Algorithm
20 12770 ABDUR REHMAN Boruvka's algorithm for minimum
spanning trees
21 12785 IRFANULLAH Reverse-delete algorithm
22 12816 MUHAMMAD WALEED KHALIL Depth first search
23 12819 SOHAIB HASEEB Breadth first search
24 12851 AASIM SAFEER Max flow min cut theorem

25 12853 MUHAMMAD SAAD A* algorithm

26 12857 HANZALA KHAN Floyd–Warshall algorithm

27 12890 ABDUL HADI Graph homomorphism

28 12894 MUSTAFA SHIRZAD Kruskal's algorithm

29 12896 MUHAMMAD FAIZAN ALI KHAN Prim's algorithm

30 12926 MUHAMMAD REHAN Adjacency list or

Adjacency matrix
31 12930 MUHAMMAD HAMZA AZMAT Canadian traveller problem

32 12932 MUHAMMAD ZAIN UL ABIDIN Digraphs

33 12933 SHAHID IQBAL Binary Search Tree
34 12992 HUZAIFA GHAFOOR Network Flow using Ford
Fulkerson Rule