Lesson 1 of 29 â€¢ 81 upvotes â€¢ 2:28 mins

29 lessons â€¢ 2 h 38 m

Overview of the Course (in Hindi)

2:28 mins

Graph Colouring (in Hindi)

5:35 mins

Minimum Number of Colours Required to Color a Graph (in Hindi)

5:19 mins

Chromatic Number (in Hindi)

5:20 mins

Check your Solution to Find Chromatic Number of this Graph (in Hindi)

5:14 mins

Recognise isomorphic graph( in Hindi)

7:25 mins

Find planer and non planer graph (in Hindi)

5:03 mins

Find planet graph from these graphs( in Hindi)

5:23 mins

Graph cannot be planar if it contains a Kuratowski subgraph( in Hindi)

8:17 mins

Topological Sorting of vertices of a Directed Acyclic Graph (in Hindi)

5:20 mins

Kuratowskiâ€™s Theorem to find minimum number of vertices( in Hindi)

7:04 mins

Maximum number of edges in a n â€“ node undirected graph( in Hindi )

4:56 mins

Depth First Search (DFS) sequence( in Hindi )

4:21 mins

Primâ€™s algorithm to construct a minimum spanning tree (in Hindi )

5:18 mins

MCQs Graph theory( in Hindi)

5:20 mins

Isomorphic to the given graph(in Hindi)

4:25 mins

What is Hamiltonian Graph ?( in Hindi )

6:30 mins

Non planer graph related question (in Hindi)

4:31 mins

What is the number of vertices in undirected connected graph (in Hindi)

5:37 mins

TRUE for any simple connected undirected graph with more that 2 vertices?( In Hindi )

4:46 mins

The number of leaf nodes in the binary tree (in Hindi)

4:19 mins

Minimum spanning tree using kruskal's algorithm( in Hindi)

5:24 mins

Minimum spanning tree using prim's algorithm( in Hindi )

5:51 mins

The number of edges in a regular graph of degree d and n vertices is (in Hindi )

6:24 mins

Topological ordering (in Hindi )

7:06 mins

Weighted connected undirected graph( in Hindi )

5:30 mins

Find topological ordering of this graph( in Hindi )

5:42 mins

Bounded faces in a graph (in Hindi )

5:07 mins

Bounded faces in a graph (in Hindi )

5:07 mins