Publications associées à Théorème des quatre couleurs

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 ...

ELSEVIER2021

Minimal graphs for 2-factor extension

Dominique de Werra

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 ...

ELSEVIER2020

Distributed Coloring of Graphs with an Optimal Number of Colors

Etienne Michel François Bamas

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 INFORMATICS2019

Form finding in elastic gridshells

Pedro Miguel Nunes Pereira de Almeida Reis, Changyeob Baek

Elastic gridshells comprise an initially planar network of elastic rods that are actuated into a shell-like structure by loading their extremities. The resulting actuated form derives from the elastic buckling of the rods subjected to inextensibility. We s ...

National Academy of Sciences2018

Combinatorics of Loop Equations for Branched Covers of Sphere

Nicolas Gerson Orantin

We prove, in a purely combinatorial way, the spectral curve topological recursion for the problem of enumeration of bi-colored maps, which are dual objects to dessins d'enfant. Furthermore, we give a proof of the quantum spectral curve equation for this pr ...

OXFORD UNIV PRESS2018

Unsplittable coverings in the plane

János Pach, Doemoetoer Palvoelgyi

A system of sets forms an m-fold covering of a set X if every point of X belongs to at least m of its members. A 1-fold covering is called a covering. The problem of splitting multiple coverings into several coverings was motivated by classical density est ...

Academic Press Inc Elsevier Science2016

Unsplittable Coverings in the Plane

János Pach, Doemoetoer Palvoelgyi

A system of sets forms an m-fold covering of a set X if every point of X belongs to at least m of its members. A 1-fold covering is called a covering. The problem of splitting multiple coverings into several coverings was motivated by classical density est ...

Springer-Verlag Berlin2016

Well-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

Triangle-Free Geometric Intersection Graphs with Large Chromatic Number

Bartosz Maria Walczak, Michal Lason

Several classical constructions illustrate the fact that the chromatic number of a graph may be arbitrarily large compared to its clique number. However, until very recently no such construction was known for intersection graphs of geometric objects in the ...

Springer US2013

On the Performance of Percolation Graph Matching

Matthias Grossglauser, Lyudmila Yartseva

Graph matching is a generalization of the classic graph isomorphism problem. By using only their structures a graph-matching algorithm finds a map between the vertex sets of two similar graphs. This has applications in the de-anonymization of social and in ...

ACM2013