11:26
What is a Graph? | Graph Theory
Wrath of Math
3:31
What are Adjacent Vertices? | Graph Theory
2:31
What is the Order of a Graph? | Graph Theory
2:49
What is the Size of a Graph? | Graph Theory
3:20
Order and Size of a Graph | Graph Theory
4:19
Empty Graph, Trivial Graph, and the Null Graph | Graph Theory
4:54
What are Adjacent Edges? | Graph Theory
6:50
What is a Subgraph? | Graph Theory
4:03
What is a Spanning Subgraph? | Graph Theory
9:26
Proper and Improper Subgraphs | Graph Theory
What is a Vertex Induced Subgraph? | Graph Theory
7:18
What is an Edge-Induced Subgraph? | Graph Theory
5:43
What is a Walk? | Graph Theory
5:11
What is a Trail? | Graph Theory
6:07
What is a Path? | Graph Theory
7:42
Proof: If There is a u-v Walk then there is a u-v Path | Every Walk Contains a Path, Graph Theory
4:16
What is a Circuit? | Graph Theory
7:15
What is a Graph Cycle? | Graph Theory, Cycles, Cyclic Graphs, Simple Cycles
3:09
What are Connected Vertices? | Graph Theory
5:36
What are Connected Graphs? | Graph Theory
5:17
What is a Component of a Graph? | Connected Components, Graph Theory
8:05
Explaining Components of Graphs | Graph Theory
4:39
Connection as an Equivalence Relation | Graph Theory
5:40
Graphs Have at Least n-m Components | Graph Theory
5:05
Size and Degree from Vertex Deleted Subgraphs | Graph Theory
9:20
Distance Between Two Vertices in Graphs | Graph Theory
4:22
What are Geodesics? | Graph Theory
8:00
Diameter of a Graph | Graph Theory
11:19
Proof: Connected Graph Contains Two Non-Cut Vertices | Graph Theory, Connected Graphs
5:37
What is a Path Graph? | Graph Theory
4:52
What are Cycle Graphs? | Graph Theory, Graph Cycles, Cyclic Graphs
3:54
What is a Complete Graph? | Graph Theory
7:51
Number of Edges in a Complete Graph (Using Combinations) | Graph Theory, Combinatorics
5:34
How Many Graphs on n Vertices? | Graph Theory
6:14
What is the Complement of a Graph? | Graph Theory, Graph Complements, Self Complementary Graphs
6:44
Proof: A Graph or its Complement Must be Connected | Graph Theory, Graph Complements
What is a Bipartite Graph? | Graph Theory
8:20
Proof: Closed Odd Walk contains Odd Cycle | Graph Theory
6:58
Proof: Bipartite Graphs have no Odd Cycles | Graph Theory, Bipartite Theorem, Proofs
20:05
Proof: If a Graph has no Odd Cycles then it is Bipartite | Graph Theory, Bipartite Theorem
8:55
How to Tell if Graph is Bipartite (by hand) | Graph Theory
7:55
What are Complete Bipartite Graphs? | Graph Theory, Bipartite Graphs
8:42
Intro to Hypercube Graphs (n-cube or k-cube graphs) | Graph Theory, Hypercube Graph
6:37
Overview of Loops in Graph Theory | Graph Loop, Multigraphs, Pseudographs
13:42
Intro to Directed Graphs | Digraph Theory
17:13
Parallel Edges in Multigraphs and Digraphs | Graph Theory, Multiple Edges, Multisets
6:26
What is the Degree of a Vertex? | Graph Theory
8:37
Neighborhood of a Vertex | Open and Closed Neighborhoods, Graph Theory
5:24
The First Theorem of Graph Theory | Graph Theory
6:52
Proof: Every Graph has an Even Number of Odd Degree Vertices | Graph Theory
Proof: Degree Sum Condition for Connected Graphs | Connected Graphs, Nonadjacent Vertices
7:26
Proof: Minimum Degree Condition for Connected Graphs | Graph Theory
What are Regular Graphs? | Graph Theory
3:08
What are Cubic Graphs? | Graph Theory
11:02
Simple Definition of Petersen Graph | Graph Theory
8:46
Degree Sequence of a Graph | Graph Theory, Graphical Sequences
12:45
Which Sequences are Graphical? (Degree Sequences and Havel-Hakimi algorithm) | Graph Theory
7:58
What are Irregular Graphs? (and why they are boring) | Graph Theory
12:21
What are Isomorphic Graphs? | Graph Isomorphism, Graph Theory
8:14
Isomorphic Graphs Have the Same Degree Sequence | Graph Theory
16:39
Graph Automorphisms and Vertex Transitive Graphs | Graph Theory
Edge Subtraction and Bridges in Graphs | Graph Theory, Edge Deletion
7:59
What are Bridges of Graphs? | Graph Theory, Edge Deletion
12:19
Proof: An Edge is a Bridge iff it Lies on No Cycles | Graph Theory
10:38
Intro to Tree Graphs | Trees in Graph Theory, Equivalent Definitions
Proof: Graph is a Tree iff Unique Paths for Each Vertex Pair | Graph Theory, Tree Graphs
8:32
Proof: Tree Graphs Have at Least Two End Vertices | Graph Theory
6:39
Proof: Tree Graph of Order n Has Size n-1 | Graph Theory
6:09
Proof: Forest Graphs have n-k Edges | Graph Theory
8:43
Proof: Connected Graph of Order n Has at least n-1 Edges | Graph Theory
9:27
Proof: Every Connected Graph has a Spanning Tree | Graph Theory
5:50
Kruskal's Algorithm for Minimum Spanning Trees (MST) | Graph Theory
11:32
Prim's Algorithm for Minimum Spanning Trees (MST) | Graph Theory
Proof on Cut Vertices Incident with Bridges | Graph Theory
6:23
Important Theorem about Cut Vertices | Graph Theory
10:25
Proof of a Characterization of Cut Vertices | Graph Theory
10:23
Proof: A Furthest Vertex is not a Cut Vertex | Graph Theory, Connected Graphs
10:46
What are Non-Separable Graphs? | Graph Theory
8:04
Vertex Cuts in Graphs (and a bit on Connectivity) | Graph Theory, Vertex-Connectivity
8:52
Vertex Connectivity of a Graph | Connectivity, K-connected Graphs, Graph Theory
8:06
Simple Bounds on Vertex Connectivity | Graph Theory
9:54
Vertex Connectivity of the Petersen Graph | Graph Theory
9:36
Edge Cuts and Edge Connectivity | Graph Theory
12:16
Edge Connectivity of Complete Graphs | Graph Theory
9:12
What are Vertex Separating Sets? | Graph Theory
12:24
What are Vertex Disjoint Paths? | Graph Theory
10:44
Intro to Menger's Theorem | Graph Theory, Connectivity
31:18
Proof: Menger's Theorem | Graph Theory, Connectivity
7:43
Eulerian Circuits and Eulerian Graphs | Graph Theory
9:29
Unicursal Graphs and Unicursal Lines | Semi-Eulerian Trails, Graph Theory
19:23
Proof: Graph is Eulerian iff All Vertices have Even Degree | Euler Circuits, Graph Theory
11:54
Hamiltonian Cycles, Graphs, and Paths | Hamilton Cycles, Graph Theory
14:36
Proof: Ore's Theorem for Hamiltonian Graphs | Sufficient Condition for Hamilton Graphs, Graph Theory
21:13
Proof: Necessary Component Condition for Graphs with Hamiltonian Paths | Graph Theory
8:34
Proof: Necessary Component Condition for Hamiltonian Graphs | Graph Theory
16:05
Proof: Dirac's Theorem for Hamiltonian Graphs | Hamiltonian Cycles, Graph Theory
Indegree and Outdegree in Directed Graphs | Graph Theory
5:22
In-Neighborhoods and Out-Neighborhoods in Digraphs | Graph Theory
5:49
Orientations of Graphs | Directed Graphs, Digraph Theory
What are Symmetric Digraphs? | Graph Theory
7:13
First Theorem of Directed Graphs | Digraph Theory
Underlying Graphs of Digraphs | Directed Graphs, Graph Theory
Weakly Connected Directed Graphs | Digraph Theory
6:38
Strongly Connected Directed Graphs | Graph Theory, Digraph Theory
9:53
Intro to Tournament Graphs | Graph Theory
11:33
Transitive Tournaments (Directed Graphs) | Graph Theory
10:40
Proof: Tournament is Transitive iff it has No Cycles | Graph Theory
Proof for Distances from Tournament's Maximum Outdegree Vertex | Graph Theory
Proof: Every Tournament has Hamiltonian Path | Graph Theory
7:32
Proof: Vertices of Strong Tournament Lie on Triangles | Graph Theory
18:01
Matchings, Perfect Matchings, Maximum Matchings, and More! | Independent Edge Sets, Graph Theory
6:56
Perfect Matchings on Complete Graphs | Graph Theory
15:25
Hall's Theorem and Condition for Bipartite Matchings | Graph Theory, Hall's Marriage Theorem
39:13
Proof: Hall's Marriage Theorem for Bipartite Matchings | Graph Theory
Proof: Regular Bipartite Graph is Balanced | Graph Theory, Partite Sets
7:24
Proof: Regular Bipartite Graph has a Perfect Matching | Graph Theory
7:45
Edge Covers and Edge Covering Numbers of Graphs | Graph Theory
7:00
Independent Vertex Sets and Independence Numbers | Graph Theory
15:33
Vertex Covers and Vertex Covering Numbers | Graph Theory
5:09
Complement of Vertex Cover is Independent Vertex Set | Graph Theory
8:35
Complement of Independent Set is Vertex Cover | Graph Theory
6:43
What are Graph Decompositions? | Graph Decomposition, Graph Theory
17:23
What are Planar Graphs? | Graph Theory
15:55
Proof: Euler's Formula for Plane Graphs | Graph Theory
16:15
Proof: Upper Bound for the Size of Planar Graphs | Graph Theory
5:57
Every Planar Graph has a Vertex of Degree 5 or Less | Graph Theory
7:29
Which Complete Graphs are Planar? | Graph Theory
Edges that Lie on One Boundary of a Region in a Plane Graph | Graph Theory
11:11
Degree of a Face in a Plane Graph | Graph Theory
13:23
Vertex Colorings and the Chromatic Number of Graphs | Graph Theory
7:20
Chromatic Number of Bipartite Graphs | Graph Theory
7:05
Chromatic Number of Complete Graphs | Graph Theory
7:23
What is a Clique? | Graph Theory, Cliques
10:43
Does Chromatic Number n Imply Clique on n Vertices? | Graph Theory
14:58
Edge Colorings and Chromatic Index of Graphs | Graph Theory
5:13
Subtracting a Vertex from a Graph (Vertex Deletion) | Graph Theory
5:00
What are Star Graphs? | Graph Theory
What is a Highly Irregular Graph? | Locally Irregular Graph, Graph Theory
4:58
Graph Representation with an Adjacency Matrix | Graph Theory, Adjaceny Matrices
What is a Maximal Clique? | Graph Theory, Cliques, Maximal Cliques
9:35
A Proof on Hamiltonian Complete Bipartite Graphs | Graph Theory, Hamiltonian Graphs
Maximum and Maximal Cliques | Graph Theory, Clique Number
8:51
Proof: Non-Regular Graph has Adjacent Vertices with Distinct Degrees | Connected Graphs
17:10
Proof: Two Longest Paths Have a Common Vertex | Graph Theory, Connected Graphs
Proof: A Graph or its Complement is not Bipartite | Graph Theory, Bipartite Graphs
5:58
Proof: Graph with all Even Degree Vertices has no Bridges | Graph Theory
8:10
Proof: Complement of Regular Non-Eulerian Graph is Eulerian | Graph Theory, Euler Graphs
8:28
Minimum and Maximum Degree Vertices in Complement Graphs | Graph Complements, Graph Theory
Bound on the Sum of Minimum Degrees of Graphs and their Complements | Graph Theory Proofs
5:35
Proof: Connected Graph with a Bridge must have a Cut Vertex | Graph Theory
9:04
Proof: Cut Vertex is not a Cut Vertex of the Complement Graph | Graph Theory
18:12
Resolving Sets and Metric Dimension of Graphs | Graph Theory
11:16
What are the Maximum and Maximal Cliques of this Graph? | Graph Theory
9:32
Bipartite Graphs with Isolated Vertices | Graph Theory, Complete Bipartite Graphs
11:44
Proof: Graph with n Vertices and n-1 Edges is a Tree | Graph Theory
11:05
Proof: A Bridge is the Unique Path connecting its End Vertices | Graph Theory
6:59
Proof: Every Edge of a Tree is a Bridge | Graph Theory
Proof: Every Graph Contains Minimum Degree Length Path | Graph Theory
Proof: Graph has a Cycle Longer than its Minimum Degree | Graph Theory
6:29
Graphs are Metric Spaces | Graph Theory
5:44
Eccentricity of a Vertex | Graph Theory
9:30
Diameter and Radius of Graphs | Graph Theory
Graph Diameter is Bounded by Radius | Graph Theory
8:41
Diameter and Radius of Tree Graphs | Graph Theory
6:49
Eccentricities of Adjacent Vertices Differ by at Most 1 | Graph Theory
8:11
Dominating Sets and Domination Number of Graphs | Graph Theory
