Laboratoire d'Informatique de Bourgogne

output

20182025

most citedCharacterizing the Interactions Between Classical and Community-aware Centrality Measures in Complex Networks

63 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions

Showing math.COShow all

6 papers · 1 filter

math.CO2024

Enumerating runs, valleys, and peaks in Catalan words

Jean-Luc Baril, Pamela E. Harris, Kimberly J. Harry +2

We provide generating functions, formulas, and asymptotic expressions for the number of Catalan words based on the number of runs of ascents (descents), runs of weak ascents (desce…

math.CO2024

The Combinatorics of Motzkin Polyominoes

Jean-Luc Baril, Sergey Kirgizov, José L. Ramírez +1

A word $w = w_{1} \dots w_{n}$ over the set of positive integers is a Motzkin word whenever $w_{1} = 1$ , $1 \leq w_{k} \leq w_{k - 1} + 1$ , and $w_{k - 1} \neq = w_{k}$ for $k = 2, \dots, n$ . It c…

math.CO2024★ 1 cited

Asymptotic probability for connectedness

Thierry Monteil, Khaydar Nurligareev

We study the structure of the asymptotic expansion of the probability that a combinatorial object is connected. We show that the coefficients appearing in those asymptotics are int…

math.CO2022

Grand Dyck paths with air pockets

Jean-Luc Baril, Sergey Kirgizov, Rémi Maréchal +1

Grand Dyck paths with air pockets (GDAP) are a generalization of Dyck paths with air pockets by allowing them to go below the $x$ -axis. We present enumerative results on GDAP (or t…

math.CO2022

On List Coloring with Separation of the Complete Graph and Set System Intersections

Jean-Christophe Godin, Rémi Grisot, Olivier Togni

We consider the following list coloring with separation problem: Given a graph $G$ and integers $a, b$ , find the largest integer $c$ such that for any list assignment $L$ of $G$ wit…

math.CO2018★ 19 cited

Packing colorings of subcubic outerplanar graphs

Boštjan Brešar, Nicolas Gastineau, Olivier Togni

Given a graph $G$ and a nondecreasing sequence $S = (s_{1}, \dots, s_{k})$ of positive integers, the mapping $c : V (G) ⟶ {1, \dots, k}$ is called an $S$ -packing coloring of $G…