Français Anglais
Accueil Annuaire Plan du site
Accueil > Evenements > Séminaires
Séminaire d'équipe(s) GALaC
2-distance coloring of not-so-sparse graphs.
Clement Charpentier

16 May 2014, 14h30 - 16 May 2014, 15h30
Salle/Bat : 465/PCRI-N
Contact :

Activités de recherche :

Résumé :
The 2-distance coloring of a graph G is a proper coloring of G where every pair of vertices sharing a common neighbor
receives different colors.

The "maximum average degree" or "mad" of a graph is the maximum among the average degrees of its subgraphs.
This is a way to evaluate the density (or the sparseness) of a graph, both globally and locally.

Several results exist about the lesser number of colors needed for 2-distance coloring of graphs with bounded mad.
However, in all these results, the bound is strictly lesser than 4.

We present upper and lower bounds for the "2-distance chromatic number" of graphs with mad bounded by 2k for every k.

Pour en savoir plus :
Séminaires
A Family of Tractable Graph Distances
Gestion de données du Web
Wednesday 04 July 2018 - 10h30
Salle : 465 - PCRI-N
Stratis Ioannidis .............................................

Binary pattern of length greater than 14 are abeli
Combinatoire
Friday 29 June 2018 - 14h30
Salle : 445 - PCRI-N
Matthieu Rosenfeld .............................................

Distributionally Robust Optimization with Principa
Optimisation combinatoire et stochastique
Friday 29 June 2018 - 11h00
Salle : 455 - PCRI-N
Dr. Jianqiang Cheng .............................................

Caractérisation de réseaux égocentrés par l'énumér
Friday 15 June 2018 - 14h30
Salle : 455 - PCRI-N
Raphaël Charbey .............................................

DATA VERACITY ASSESSMENT: HOW A-PRIORI KNOWLEDGE E
Intégration de données et de connaissances
Friday 15 June 2018 - 14h00
Salle : 445 - PCRI-N
Valentina Beretta .............................................