New Assignments
Module NameDownload
noc20_ma05_assigment_1noc20_ma05_assigment_1
noc20_ma05_assigment_2noc20_ma05_assigment_2
noc20_ma05_assigment_3noc20_ma05_assigment_3
noc20_ma05_assigment_4noc20_ma05_assigment_4
noc20_ma05_assigment_5noc20_ma05_assigment_5
noc20_ma05_assigment_6noc20_ma05_assigment_6
noc20_ma05_assigment_7noc20_ma05_assigment_7
noc20_ma05_assigment_8noc20_ma05_assigment_8
noc20_ma05_assigment_9noc20_ma05_assigment_9

Sl.No Chapter Name English
1Basic ConceptsDownload
To be verified
2Basic Concepts 1Download
To be verified
3Eulerian and Hamiltonian GraphDownload
To be verified
4Eulerian and Hamiltonian Graph 1Download
To be verified
5Bipartite GraphDownload
To be verified
6Bipartite GraphDownload
To be verified
7Diameter of a graph; Isomorphic graphsDownload
To be verified
8Diameter of a graph; Isomorphic graphsDownload
To be verified
9Minimum Spanning TreeDownload
To be verified
10Minimum Spanning Trees (Cont.)Download
To be verified
11Minimum Spanning Trees (Cont..)Download
To be verified
12Minimum Spanning Trees (Cont...)Download
To be verified
13Maximum Matching in Bipartite GraphDownload
To be verified
14Maximum Matching in Bipartite Graph 1Download
To be verified
15Hall's Theorem and Konig's TheoremDownload
To be verified
16Hall's Theorem and Konig's Theorem 1Download
To be verified
17Independent Set and Edge CoverDownload
To be verified
18Independent Set and Edge Cover 1Download
To be verified
19 Matching in General GraphsDownload
To be verified
20 Proof of Halls TheoremDownload
To be verified
21Stable MatchingDownload
To be verified
22Gale-Shapley AlgorithmDownload
To be verified
23Graph ConnectivityDownload
To be verified
24Graph Connectivity 1Download
To be verified
25 2-Connected GraphsDownload
To be verified
26 2-Connected Graphs 1Download
To be verified
27Subdivision of an edge; 2-edge-connected graphsDownload
To be verified
28Problems Related to Graphs ConnectivityDownload
To be verified
29Flow NetworkDownload
To be verified
30 Residual Network and Augmenting PathDownload
To be verified
31Augmenting Path AlgorithmDownload
To be verified
32Max-Flow and Min-CutDownload
To be verified
33Max-Flow and Min-Cut TheoremDownload
To be verified
34Vertex ColouringDownload
To be verified
35Chromatic Number and Max. DegreeDownload
To be verified
36Edge ColouringDownload
To be verified
37Planar Graphs & Euler's FormulaDownload
To be verified
38 Characterization Of Planar GraphsDownload
To be verified
39Colouring of Planar GraphsDownload
To be verified


Sl.No Language Book link
1EnglishNot Available
2BengaliNot Available
3GujaratiNot Available
4HindiNot Available
5KannadaNot Available
6MalayalamNot Available
7MarathiNot Available
8TamilNot Available
9TeluguNot Available