Edge Colorings and Chromatic Index of Graphs | Graph Theory
We introduce edge colorings of graphs and the edge chromatic number of graphs, also called the chromatic index. We'll talk about k-colorings/k-edge colorings, minimum edge colorings, edge colourings as matchings, edge colourings as functions, and see examples and non-examples of edge color
From playlist Graph Theory
Edge Coloring and the Chromatic Index of a Graph
This video introduces edge coloring and the chromatic index of a graph. An application of the chromatic index is provided. mathispower4u.com
From playlist Graph Theory (Discrete Math)
Discrete Math II - 10.8.1 Graph Coloring
This video focuses on graph coloring, in which color the vertices of a graph so that no two adjacent vertices have the same color. Most often, graph coloring is used for scheduling purposes, as we can determine when there are conflicts in scheduling if two vertices are the same color. Vi
From playlist Discrete Math II/Combinatorics (entire course)
Introduction to Vertex Coloring and the Chromatic Number of a Graph
This video introduces vertex coloring and provides example of how to determine the chromatic number of a graph. mathispower4u.com
From playlist Graph Theory (Discrete Math)
Vertex Covers and Vertex Covering Numbers | Graph Theory
We introduce vertex covers, minimum vertex covers, and vertex covering numbers! We'll see some examples and non-examples of vertex covers, as well as minimum vertex covers and some that aren't minimum. The number of vertices in a minimum vertex cover is called the vertex covering number of
From playlist Graph Theory
Rotating graph of graph with four critical points
From playlist 3d graphs
Sweeping under area of a curve
From playlist 2d graphs
Beginning Graphic Design: Color
In this video, you’ll learn the basics of using color in graphic design. Visit https://www.gcflearnfree.org/beginning-graphic-design/color/1/ for our text-based lesson. This video includes information on: • Hue, saturation, and value • Creating monochromatic, analogous, and other color sc
From playlist Graphic Design
Kernels, marriages, and the Dinitz problem #SoME2
The Dinitz problem is a graph theory problem proposed by Jeff Dinitz in 1979, and solved by Fred Galvin in 1994, 15 years later! In the video, I share the solution, along with some motivation that could have resulted in the solution. I hope you enjoy! I first heard of the problem in Diest
From playlist Summer of Math Exposition 2 videos
Louis Esperet: Coloring graphs on surfaces
Recording during the thematic meeting: "Graphs and surfaces: algorithms, combinatorics and topology" the May 11, 2016 at the Centre International de Rencontres Mathématiques (Marseille, France) Filmmaker: Guillaume Hennenfent Find this video and other talks given by worldwide mathematici
From playlist Mathematical Aspects of Computer Science
Puzzle 10: A Weekend To Remember
MIT 6.S095 Programming for the Puzzled, IAP 2018 View the complete course: https://ocw.mit.edu/6-S095IAP18 Instructor: Srini Devadas You are happy when your friends are happy. This means making sure that some pairs of your friends never meet at any of your parties. This video will explain
From playlist MIT 6.S095 Programming for the Puzzled, January IAP 2018
8ECM Invited Lecture: Daniela Kühn
From playlist 8ECM Invited Lectures
Lecture 12 - Depth-First Search
This is Lecture 12 of the CSE373 (Analysis of Algorithms) course taught by Professor Steven Skiena [http://www3.cs.stonybrook.edu/~skiena/] at Stony Brook University in 2016. The lecture slides are available at: https://www.cs.stonybrook.edu/~skiena/373/newlectures/lecture12.pdf More inf
From playlist CSE373 - Analysis of Algorithms 2016 SBU
How To Model Articulated Action Figurine For 3D Printing | Session 05 | #gamedev
Don’t forget to subscribe! In this project series, you will learn how to model articulated action figurines for 3D printing. In this tutorial, we will be designing Futurama's Bender articulated figurine for 3D printing. It will have fully articulated arms and legs (these will utilize mu
From playlist Model Articulated Action Figurine For 3D Printing
Graph list-coloring and Thomassen's theorem #SoME2
Some videos on topics that appear on the video: Induction: https://www.youtube.com/watch?v=5Hn8vUE3cBQ Planar graphs & four color theorem: https://www.youtube.com/watch?v=xBkTIp6ajAg https://www.youtube.com/watch?v=NgbK43jB4rQ Image credit: Francis Guthrie: Unknown author, Public domain,
From playlist Summer of Math Exposition 2 videos
Math for Liberal Studies - Lecture 1.7.2 The Greedy Coloring Algorithm
This is the second video lecture for Math for Liberal Studies Section 1.7: Coloring Graphs. In this video, I discuss the "greedy coloring algorithm." This method can be used to properly color the vertices of a graph. I also discuss several other applications of graph coloring.
From playlist Math for Liberal Studies Lectures
OpenCV Course - Full Tutorial with Python
Learn everything you need to know about OpenCV in this full course for beginners. You will learn the very basics (reading images and videos, image transformations) to more advanced concepts (color spaces, edge detection). Towards the end, you'll have hands-on experience building a Deep Com
From playlist Machine Learning
Order 0 approximations of a surface
From playlist 3d graphs