In graph theory, oriented graph coloring is a special type of graph coloring. Namely, it isan assignment of colors to vertices of an oriented graph that * is proper: no two adjacent vertices get the same color, and * is consistently oriented: if vertices and have the same color, and vertices and have the same color, then and cannot both be edges in the graph. Equivalently, an oriented graph coloring of a graph G is an oriented graph H (whose vertices represent colors and whose arcs represent valid orientations between colors) such that there exists a homomorphism from G to H. An oriented chromatic number of a graph G is the fewest colors needed in an oriented coloring;it is usually denoted by . The same definition can be extended to undirected graphs, as well, by defining the oriented chromatic number of an undirected graph to be the largest oriented chromatic number of any of its orientations. (Wikipedia).
Math for Liberal Studies: The Greedy Coloring Algorithm
In this video, we use the Greedy Coloring Algorithm to solve a couple of graph coloring problems. For more info, visit the Math for Liberal Studies homepage: http://webspace.ship.edu/jehamb/mls/index.html
From playlist Math for Liberal Studies
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
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
Polarized Light and Polarized Filters
Learn what polarized light is and how it is different than unpolarized light. And learn how a Polaroid filter polarizes light waves and the role of sunglasses in blocking the glare caused by polarized light. You can find more information that supports this video on our website. Lesson No
From playlist Light Waves and Color Tutorial Series
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)
PowerPoint: Aligning, Ordering, and Grouping Objects
In this video, you’ll learn the basics of aligning, ordering, and grouping objects in PowerPoint 2019, PowerPoint 2016, and Office 365. Visit https://edu.gcfglobal.org/en/powerpoint/aligning-ordering-and-grouping-objects/1/ for our text-based lesson. This video includes information on: •
From playlist Microsoft PowerPoint
Watch more videos on http://www.brightstorm.com/math/geometry SUBSCRIBE FOR All OUR VIDEOS! https://www.youtube.com/subscription_center?add_user=brightstorm2 VISIT BRIGHTSTORM.com FOR TONS OF VIDEO TUTORIALS AND OTHER FEATURES! http://www.brightstorm.com/ LET'S CONNECT! Facebook ► https
From playlist Geometry
Photoshop: Levels, Curves, and Color
In this video, you’ll learn more about levels, curves, and color in Photoshop. Visit https://www.gcflearnfree.org/photoshopbasics/levels-curves-and-color/1/ for our text-based lesson. This video includes information on: • Adjusting levels • Using Curves in Photoshop Elements • Making colo
From playlist Photoshop
Topological Analysis of Grain Boundaries - Srikanth Patala
Srikanth Patala Masachusetts Institute of Technology February 1, 2011 GEOMETRY AND CELL COMPLEXES Polycrystalline materials, such as metals, ceramics and geological materials, are aggregates of single-crystal grains that are held together by highly defective boundaries. The structure of g
From playlist Mathematics
Essentials of Neuroscience with MATLAB: Module 1-6 (spikes)
The goal of this module is to work with action potential data taken from a publicly available database. You will learn about spike counts, orientation tuning, and spatial maps. The MATLAB code introduces data types, for-loops and vectorizations, indexing, and data visualization. This vide
From playlist Essentials of neuroscience with MATLAB
Nicholas Cazet: Surface-link Families with Arbitrarily Large Triple Point Number
Nicholas Cazet, UC Davis Title: Surface-link Families with Arbitrarily Large Triple Point Number Analogous to a classical knot diagram, a surface-knot can be generically projected to 3-space and given crossing information to create a broken sheet diagram. A generic compact surface in 3-spa
From playlist 39th Annual Geometric Topology Workshop (Online), June 6-8, 2022
Choosing From A Negative Number Of Things?? #SoME2
Combinatorial Reciprocity Theorems by Mattias Beck and Raman Sanyal: https://page.mi.fu-berlin.de/sanyal/teaching/crt/CRT-Book-Online.pdf An introductory look at negative binomial coefficients, and in general, combinatorial reciprocity. First, we explain how to formally justify binomial
From playlist Summer of Math Exposition 2 videos
Liquid Crystals and the Heilmann-Lieb Conjecture - Ian Jauslin
https://www.ias.edu/events/friends-lunch-member-jauslin More videos on http://video.ias.edu
From playlist Friends of the Institute
Jesper Jacobsen: Geometrical web models
CONFERENCE Recording during the thematic meeting : « ALEA Days» the March 13, 2023 at the Centre International de Rencontres Mathématiques (Marseille, France) Filmmaker : Guillaume Hennenfent Find this video and other talks given by worldwide mathematicians on CIRM's Audiovisual Mathemat
From playlist Combinatorics
Garden City Ruby Conference - Opening Keynote
By, Konstantin Haase Help us caption & translate this video! http://amara.org/v/GF2p/
From playlist Garden City Ruby 2015
Jesus De Loera: Tverberg-type theorems with altered nerves
Abstract: The classical Tverberg's theorem says that a set with sufficiently many points in R^d can always be partitioned into m parts so that the (m - 1)-simplex is the (nerve) intersection pattern of the convex hulls of the parts. Our main results demonstrate that Tverberg's theorem is b
From playlist Combinatorics
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
Ethnomathematics Lecture 5: Color Symmetries
Beloit College, Math 103: Color symmetry patterns.
From playlist Beloit College: Ethnomathematics | CosmoLearning.org Mathematics
Thomas Serre: "Deep Learning in the Visual Cortex, Pt. 2"
Graduate Summer School 2012: Deep Learning, Feature Learning "Deep Learning in the Visual Cortex, Pt. 2" Thomas Serre, Brown University Institute for Pure and Applied Mathematics, UCLA July 25, 2012 For more information: https://www.ipam.ucla.edu/programs/summer-schools/graduate-summer-
From playlist GSS2012: Deep Learning, Feature Learning