In graph theory, a complete coloring is a vertex coloring in which every pair of colors appears on at least one pair of adjacent vertices. Equivalently, a complete coloring is minimal in the sense that it cannot be transformed into a proper coloring with fewer colors by merging pairs of color classes. The achromatic number ψ(G) of a graph G is the maximum number of colors possible in any complete coloring of G. A complete coloring is the opposite of a harmonious coloring, which requires every pair of colors to appear on at most one pair of adjacent vertices. (Wikipedia).
Draw Perfect Freehand Circles!
Super simple idea that allows you to draw a perfect freehand circle. Use it to win bets, or just impress your friends!
From playlist How to videos!
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
In this video, you’ll learn how to broaden your definition of design through critical thinking, in order to see it in the world around you! Visit https://www.gcflearnfree.org/ to learn even more. We hope you enjoy!
From playlist Graphic Design
Photoshop Tutorial - Using FREE TRANSFORM to resize
Scale, skew, and rotate layers with Adobe Photoshop's free transform. Watch the full course to build more Photoshop skills: https://www.linkedin.com/learning/photoshop-2020-essential-training-the-basics?trk=sme-youtube_photoshop2020esstbasics-scaling-skewing-rotating-with-free-transform_le
From playlist Adobe Photoshop
mandelbrot fractal animation 6
another mandelbrot/julia/mix animation. this time the rainbow colors fit really well, so I left them.
From playlist Fractal
If I could only glow from my whole body... heh, now I can. Glowstick Glowman Costume. www.NothingButCostumes.com
From playlist Amazing Stuff
C Programming Writing in Color
Having color output to the console on your C programs can be very useful in heighlighting to the user diffent elements that they should read. This is easily manged in C on the Raspberry Pi and other LInux systems and we step you through this in the video, We also look at simple functions t
From playlist Raspberry Pi
If you are interested in learning more about this topic, please visit http://www.gcflearnfree.org/ to view the entire tutorial on our website. It includes instructional text, informational graphics, examples, and even interactives for you to practice and apply what you've learned.
From playlist Graphic Design
Chromatic Number of Complete Graphs | Graph Theory
What are the chromatic numbers of complete graphs on n vertices? As we’ll see in today’s graph theory lesson on vertex coloring, we need exactly n colors to properly color the complete graph K_n. Intro to Graph Colorings: https://youtu.be/3VeQhNF5-rE Recall that a proper coloring (or ju
From playlist Graph Theory
Maria Chudnovsky: Coloring graphs with forbidden induced paths
Abstract: The problem of testing if a graph can be colored with a given number k of colors is NP-complete for every k[greater than]2. But what if we have more information about the input graph, namely that some fixed graph H is not present in it as an induced subgraph? It is known that the
From playlist Combinatorics
Rainbow structures, Latin squares & graph decompositions - Benny Sudakov
Computer Science/Discrete Mathematics Seminar I Topic: Rainbow structures, Latin squares & graph decompositions Speaker: Benny Sudakov Affiliation: ETH Zürich Date: March 01, 2021 For more video please visit http://video.ias.edu
From playlist Mathematics
Project Solution Live Code 9 - Introduction to Yew.rs
If you have any feedback please leave them in the comments or let me know on Discord! Course Repo: https://github.com/brooks-builds/full-stack-todo-rust-course Twitch: https://twitch.tv/brookzerker Twitter: https://twitter.com/brooks_patton
From playlist Introduction to Yew.rs Course
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
Advances on Ramsey numbers - Jacob Fox
https://www.math.ias.edu/seminars/abstract?event=83564
From playlist Computer Science/Discrete Mathematics
Guillaume Fertin : Le problème Graph Motif - Partie 1
Résumé : Le problème Graph Motif est défini comme suit : étant donné un graphe sommet colorié G=(V,E) et un multi-ensemble M de couleurs, déterminer s'il existe une occurrence de M dans G, c'est-à-dire un sous ensemble V' de V tel que (1) le multi-ensemble des couleurs de V' correspond à M
From playlist Mathematics in Science & Technology
Upper and Lower Bounds for the Chromatic Number of a Graph
This video explains how to determine the upper and lower bounds of the chromatic number to various graphs. Then the chromatic number is found. mathispower4u.com
From playlist Graph Theory (Discrete Math)
Colin Wright - Colours Can Compute - CoM Apr 2021
Colouring maps and networks seems like child’s play, but in truth it turns out to be much more interesting, and to have wide-reaching consequences. In this talk we’ll play with some colourings, and see why it’s an important problem and the subject of current research. This talk has a prac
From playlist Celebration of Mind 2021
Discrete Math II - 10.2.2 Special Graphs: Bipartite Graphs
This video is a deeper look at bipartite graphs. We look at both the definition of a bipartite graph and using graph coloring to determine if an existing graph can be redrawn as bipartite. In addition, we model real-life scenarios with bipartite graphs in an effort to create a complete mat
From playlist Discrete Math II/Combinatorics (entire course)