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
Demographic reconstruction from paleogenomes of th
Thursday 25 February 2021 - 14h00
Salle : 435 - PCRI-N
Nina Marchi .............................................

A Graph-based Similarity Approach to Classify Recu
Thursday 18 February 2021 - 14h00
Salle : 435 - PCRI-N
Coline Gianfrotta .............................................

"Answer Set Programming for computing constraints-
Thursday 04 February 2021 - 14h00
Salle : 435 - PCRI-N
Maxime Mahout .............................................

"Pand├Žsim: An Epidemic Spreading Stochastic Simula
Thursday 14 January 2021 - 14h00
Salle : 435 - PCRI-N
Patrick Amar .............................................

Disentangling the role of selection on the evoluti
Friday 02 October 2020 - 17h30
Salle : 455 - PCRI-N
Fanny Pouyet .............................................