Graph coloring

Interval chromatic number of an ordered graph

In mathematics, the interval chromatic number X<(H) of an ordered graph H is the minimum number of intervals the (linearly ordered) vertex set of H can be partitioned into so that no two vertices belonging to the same interval are adjacent in H. (Wikipedia).

Video thumbnail

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)

Video thumbnail

Determine Which Graphs have a Given Chromatic Number

This video explains how to determine which special graphs have a chromatic number of 6. mathispower4u.com

From playlist Graph Theory (Discrete Math)

Video thumbnail

Find the Chromatic Number of the Given Graphs

This video explains how to determine a proper vertex coloring and the chromatic number of a graph. mathispower4u.com

From playlist Graph Theory (Discrete Math)

Video thumbnail

Order and Size of a Graph | Graph Theory

What is the order and size of a graph? We'll go over them both in this math lesson! A graph is an ordered pair with a vertex set and an edge set. The order of a graph is the cardinality of its vertex set, which is the number of vertices in the graph. The size of a graph is the cardinality

From playlist Graph Theory

Video thumbnail

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

Video thumbnail

Determine If an Ordered Pair is a Solution to a Linear Equation

This video explains how to determine if an ordered pair is a solution to a given linear equation. http://mathispower4u.com

From playlist Graphing Linear Equations Using a Table of Values

Video thumbnail

Graph Theory: 66. Basic Bound on the Chromatic Number

In this video we prove by induction that every graph has chromatic number at most one more than the maximum degree. Odd cycles and complete graphs are examples for which the chromatic number meets this upper bound exactly. For other graphs, Brook's Theorem tells us that the chromatic num

From playlist Graph Theory part-11

Video thumbnail

The abstract chromatic number - Leonardo Nagami Coregliano

Computer Science/Discrete Mathematics Seminar I Topic: The abstract chromatic number Speaker: Leonardo Nagami Coregliano Affiliation: University of Chicago Date: March 22, 2021 For more video please visit http://video.ias.edu

From playlist Mathematics

Video thumbnail

Random Cayley Graphs - Noga Alon

Noga Alon Tel Aviv University; Member, School of Mathematics November 25, 2013 The study of random Cayley graphs of finite groups is related to the investigation of Expanders and to problems in Combinatorial Number Theory and in Information Theory. I will discuss this topic, describing the

From playlist Mathematics

Video thumbnail

Extremal theory of ordered graphs – Gábor Tardos – ICM2018

Combinatorics Invited Lecture 13.3 Extremal theory of ordered graphs Gábor Tardos Abstract: We call simple graphs with a linear order on the vertices ‘ordered graphs’. Turán-type extremal graph theory naturally extends to ordered graphs. This is a survey on the ongoing research in the ex

From playlist Combinatorics

Video thumbnail

Dependent random choice - Jacob Fox

Marston Morse Lectures Topic: Dependent random choice Speaker: Jacob Fox, Stanford University Date: October 26, 2016 For more videos, visit http://video.ias.edu

From playlist Mathematics

Video thumbnail

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)

Video thumbnail

Graph Theory: 65. 2-Chromatic Graphs

In this video we begin by showing that the chromatic number of a tree is 2. Yet, if the chromatic number of a graph is 2, this does not imply that the graph is a tree. We then prove that the chromatic number of a graph is 2 if and only if the graph is bipartite. -- Bits of Graph Theory

From playlist Graph Theory part-11

Video thumbnail

Maria Chudnovsky: Induced cycles and coloring

Find this video and other talks given by worldwide mathematicians on CIRM's Audiovisual Mathematics Library: http://library.cirm-math.fr. And discover all its functionalities: - Chapter markers and keywords to watch the parts of your choice in the video - Videos enriched with abstracts, b

From playlist Combinatorics

Video thumbnail

Does Infinite Cardinal Arithmetic Resemble Number Theory? - Menachem Kojman

Menachem Kojman Ben-Gurion University of the Negev; Member, School of Mathematics February 28, 2011 I will survey the development of modern infinite cardinal arithmetic, focusing mainly on S. Shelah's algebraic pcf theory, which was developed in the 1990s to provide upper bounds in infinit

From playlist Mathematics

Video thumbnail

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

Video thumbnail

2.9.1 Coloring: Video

MIT 6.042J Mathematics for Computer Science, Spring 2015 View the complete course: http://ocw.mit.edu/6-042JS15 Instructor: Albert R. Meyer License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu

From playlist MIT 6.042J Mathematics for Computer Science, Spring 2015

Video thumbnail

Dieter Rautenbach: Restricted types of matchings

Abstract: We present new results concerning restricted types of matchings such as uniquely restricted matchings and acyclic matchings, and we also consider the corresponding edge coloring notions. Our focus lies on bounds, exact and approximative algorithms. Furthermore, we discuss some ma

From playlist Combinatorics

Related pages

Partition of a set | Ordered graph | Graph (discrete mathematics) | Chromatic number