13:55

Video_117: A nonempty graph is bicolourable 2 chromatic if and only if is bipartite

19:11

Video_116: A graph is bicolourable 2 chromatic if and only if it has no odd cycles

38:58

Video_114: Vertex Colouring and Chromatic Number of a Graph

14:03

Video_115: Any Tree is 2 chromatic

12:06

Video_113: Determining the distances between different pairs of vertices

17:06

Video_112: An observation about connectedness and adjacency matrix

24:15

Video_111 Powers of the Adjacency Matrix

20:28

Video_110: Traces of the Adjacency Matrix of a Graph

30:35

Video_109: Squares and Cubes of the Adjacency Matrix

14:38

Video_108 Adjacency Matrix of a Graph

40:48

Video_107: Relation between incidence and path matrix of a graph

11:37

Video_106: Path Matrix of a Graph

29:11

Video_105: Relations among Reduced Incidence, Fundamental Cycle and Fundamental Cut set Matrices

22:31

Video_104: Rank of the cut set Matrix of a Graph

18:28

Video_103: Cut Set Matrix and Fundamental Cut Set Matrix of a Graph

33:34

Video_102: Rank of the Cycle Matrix of a Graph

10:15

Video_101: Fundamental Cycle Matrix of a Graph.

34:12

Video_100: Relationship between the Incidence Matrix and the Cycle Matrix of a Graph

24:26

Video_99: Cycle (Circuit) Matrix of a Graph and its properties

26:45

Video_98: Sub-matrices of the Incidence Matrix and a property of it

20:25

Video_97: Reduced Incidence Matrix of a Graph

22:16

Video_96: Rank of the incidence matrix

20:58

Video_95: Incidence Matrix of a Graph

10:59

Video_94: A connected plane graph is bipartite if and only if its dual graph Eulerian.

11:47

Video_93: The edge e is a loop in G if and only if e* is a cut edge in the dual graph

11:41

Video_92: The dual of a plane graph is planar

29:28

Video_91: Self dual Graphs

30:17

Video_90: Dual of a Plane Graph

08:07

Video_89: Relationship between number of vertices and edges in homeomorphic graphs.

10:39

Video_88: Petersen Graph is Non planar

24:28

Video_87 Characterisation of Planar Graphs (Kuratowski's Theorem)

09:49

Video_86: Every connected planar graph has at least three vertices of degree less than 6

14:34

Video_85: K_ 5 and K_{ 3,3} are non planar

21:22

Video_84: Bound on the number of Edges in a Maximal Planar Graph

07:47

Video_83: Maximal Planar Graphs

14:56

Video_82: A bound on the number of edges in a connected plane graph

14:31

Video_81: Counting the number of edges in a plane graph in which every region is a cycle

32:53

Video_80: Euler's Formula for Plane Graph

10:08

Video_79: K_ 5 is non-planar

27:04

Video_78: Planar Graphs and their Properties

14:30

Video_77: A Property of a 2 connected Graph

09:13

Video_76: Relationship between Number of Edges, Vertices and Connectivity of a Graph

18:28

Video_75 Relationship between Vertex Connectivity and Edge Connectivity in Graph

17:33

Video_74: Vertex Connectivity and Edge Connectivity definition

20:55

Video_73: Properties of Cut Set Part 6

28:40

Video_72: Properties of Cut Set Part 5

19:59

Video_71: Properties of Cut Set Part 4

10:26

Video_70 Properties of Cut Set Part 3

09:13

Video_69: Properties of Cut Set Part 2

08:58

Video_68: Properties of Cut Set Part 1

31:13

Video_67: Cut Set and Fundamental Cut Set Definition

08:44

Video_66: Properties of Cut Edges Part 6

10:23

Video_65: Properties of Cut Edges Part 5

12:53

Video_64 Properties of Cut Edges Part 4

11:12

Video_63: Properties of Cut Edges Part 3

20:37

Video_62: Properties of Cut Edges Part 2

13:13

Video_61: Properties of Cut Edges Part 1

26:21

Video_60: Cut Edge(Bridge) definition

11:34

Video_59: Maximum Number of Cut Vertices in a Connected Graph

16:32

Video_58: Number of Cut Vertices in a Connected Graph