Concept
Théorème des quatre couleurs
Publications associées (32)
Recoloring subgraphs of K-2n for sports scheduling
The exploration of one-factorizations of complete graphs is the foundation of some classical sports scheduling problems. One has to traverse the landscape of such one-factorizations by moving from one of those to a so-called neighbor one-factorization. Thi ...
ELSEVIER2021Minimal graphs for 2-factor extension
Let G = (V, E) be a simple loopless finite undirected graph. We say that G is (2-factor) expandable if for any non-edge uv, G + uv has a 2-factor F that contains uv. We are interested in the following: Given a positive integer n = vertical bar V vertical b ...
ELSEVIER2020Distributed Coloring of Graphs with an Optimal Number of Colors
This paper studies sufficient conditions to obtain efficient distributed algorithms coloring graphs optimally (i.e. with the minimum number of colors) in the LOCAL model of computation. Most of the work on distributed vertex coloring so far has focused on ...
SCHLOSS DAGSTUHL, LEIBNIZ CENTER INFORMATICS2019Well-Posedness, Regularity, and Convergence Analysis of the Finite Element Approximation of a Generalized Robin Boundary Value Problem
Alfio Quarteroni, Luca Dede', Claudia Maria Colciago
In this paper, we propose the mathematical and finite element analysis of a second-order partial differential equation endowed with a generalized Robin boundary condition which involves the Laplace--Beltrami operator by introducing a function space $H^1(\O ...
Society for Industrial and Applied Mathematics2015