arXiv subjects

Olivier Togni

Publications and source records attributed to Olivier Togni.

At least 19 recordsLinked to original sources

arXiv2026

On Multi-label radio Labelings of Graphs

We propose and study a multi-labeling generalization of the $k$-radio labeling problem of graphs: given a graph $G$ and integers $k$ and $m$, assign to each vertex of $G$ a set of $m$ integer labels such that distinct labels assigned to a vertex differ by at least $k+1$, and the labels of any two distinct vertices $x$ and $y$ pairwise differ by at least $k+1-d(x,y)$, with $d(x,y)$ being the distance between vertices $x$ and $y$. We prove general bounds on the minimum span of such a labeling and more refined results for the case $k=1$. For paths and cycles, we derive sharp bounds on the minimum span when $k$ is small. We finally propose a conjecture for the minimum span on the path and for an almost-tight bound on the cycle.

math.CO↗

arXiv2026

On Hypergraph Colorings and Completely Independent Spanning Trees in Chordal Graphs

In this paper, we study the existence problem of completely independent spanning trees (CIST) in chordal graphs through appropriate hypergraph representations and their panchromatic and bipanchromatic colorings. First, we disprove a conjecture stating an exact relationship between the panchromatic number, the bipanchromatic number, and the minimum number of unique colors in an optimal panchromatic coloring of a hypergraph. Then, by relating CIST to panchromatic and bipanchromatic colorings of the associated hypergraphs, we derive structural conditions for their existence in chordal graphs and specifically strictly chordal graphs.

math.CO↗

arXiv2026

Constructing two completely independent spanning trees in dual-cubes

In this paper, we prove the existence of two completely independent spanning trees in the $n$-dimensional dual-cube $F_n$, a variant of the hypercube, for every $n \geq 5$. To this end, we use the hypercube structure of the clusters of $F_n$ to extend the construction of CIST from the $(n-1)$-dimensional hypercube to the dual-cube. In addition, we provide a recursive algorithm that builds the two trees while improving their diameters. Finally, we propose a conjecture regarding the existence of $k$ completely independent spanning trees in the dual-cube.

math.CO↗

arXiv2026

Completely Independent Spanning Trees in Split Graphs: Structural Properties and Complexity

We study completely independent spanning trees (CIST), \textit{i.e.}, trees that are both edge-disjoint and internally vertex-disjoint, in split graphs. We establish a correspondence between the existence of CIST in a split graph and some types of hypergraph colorings (panchromatic and bipanchromatic colorings) of its associated hypergraph, allowing us to obtain lower and upper bounds on the number of CIST. Using these relations, we prove that the problem of the existence of two CIST in a split graph is NP-complete. Finally, we formulate a conjecture on the bipanchromatic number of a hypergraph related to the results obtained for the number of CIST.

math.CO↗

arXiv2026

$t$-tone colorings of outerplanar and Halin graphs

A $t$-tone $k$-coloring of a graph $G$ assigns a set of $t$ distinct colors from $\{1, \dots, k\}$ to each vertex so that vertices at distance $d$ share fewer than $d$ common colors. The $t$-tone chromatic number of $G$ is the minimum $k$ such that $G$ has a $t$-tone $k$-coloring. This paper investigates the $t$-tone coloring of two specific subclasses of planar graphs: subcubic outerplanar graphs and Halin graphs. We provide a complete characterization of the $2$-tone chromatic number for subcubic outerplanar graphs and establish a sharp upper bound for their $3$-tone chromatic number. We then turn to Halin graphs and prove that every cubic Halin graph of order $n \ge 6$ is $2$-tone $7$-colorable. Moreover, we derive an upper bound on the $2$-tone chromatic number for Halin graphs with arbitrary maximum degree.

math.CO↗

arXiv2025

On $S$-packing Coloring of Bounded Degree Graphs

Given a sequence $S=(s_1,s_2,\ldots,s_p)$, $p\geq 2$, of non-decreasing integers, an $S$-packing coloring of a graph $G$ is a partition of its vertex set into $p$ disjoint sets $V_1,\ldots, V_p$ such that any two distinct vertices of $V_i$ are at a distance greater than $s_i$, $1\le i\le p$. In this paper, we study the $S$-packing coloring problem on graphs of bounded maximum degree and for sequences mainly containing 1's and 2's ($i^r$ in a sequence means $i$ is repeated $r$ times). Generalizing existing results for subcubic graphs, we prove a series of results on graphs of maximum degree $k$: We show that graphs of maximum degree $k$ are $(1^{k-1},2^k)$-packing colorable. Moreover, we refine this result for restricted subclasses: A graph of maximum degree $k$ is said to be $t$-saturated, $0\le t\le k$, if every vertex of degree $k$ is adjacent to at most $t$ vertices of degree $k$. We prove that any graph of maximum degree $k\ge 3$ is $(1^{k-1}, 3)$-packing colorable if it is 0-saturated, $(1^{k-1}, 2)$-packing colorable if it is $t$-saturated, $1\leq t\leq k-2$; and $(1^{k-1},2^{k-1})$-packing colorable if it is $(k-1)$-saturated. We also propose some conjectures and questions.

math.CO↗

arXiv2025

An Evaluation Tool for Backbone Extraction Techniques in Weighted Complex Networks

Networks are essential for analyzing complex systems. However, their growing size necessitates backbone extraction techniques aimed at reducing their size while retaining critical features. In practice, selecting, implementing, and evaluating the most suitable backbone extraction method may be challenging. This paper introduces netbone, a Python package designed for assessing the performance of backbone extraction techniques in weighted networks. Its comparison framework is the standout feature of netbone. Indeed, the tool incorporates state-of-the-art backbone extraction techniques. Furthermore, it provides a comprehensive suite of evaluation metrics allowing users to evaluate different backbones techniques. We illustrate the flexibility and effectiveness of netbone through the US air transportation network analysis. We compare the performance of different backbone extraction techniques using the evaluation metrics. We also show how users can integrate a new backbone extraction method into the comparison framework. netbone is publicly available as an open-source tool, ensuring its accessibility to researchers and practitioners. Promoting standardized evaluation practices contributes to the advancement of backbone extraction techniques and fosters reproducibility and comparability in research efforts. We anticipate that netbone will serve as a valuable resource for researchers and practitioners enabling them to make informed decisions when selecting backbone extraction techniques to gain insights into the structural and functional properties of complex systems.

cs.SI↗

arXiv2024

Further Results and Questions on $S$-Packing Coloring of Subcubic Graphs

For non-decreasing sequence of integers $S=(a_1,a_2, \dots, a_k)$, an $S$-packing coloring of $G$ is a partition of $V(G)$ into $k$ subsets $V_1,V_2,\dots,V_k$ such that the distance between any two distinct vertices $x,y \in V_i$ is at least $a_{i}+1$, $1\leq i\leq k$. We consider the $S$-packing coloring problem on subclasses of subcubic graphs: For $0\le i\le 3$, a subcubic graph $G$ is said to be $i$-saturated if every vertex of degree 3 is adjacent to at most $i$ vertices of degree 3. Furthermore, a vertex of degree 3 in a subcubic graph is called heavy if all its three neighbors are of degree 3, and $G$ is said to be $(3,i)$-saturated if every heavy vertex is adjacent to at most $i$ heavy vertices. We prove that every 1-saturated subcubic graph is $(1,1,3,3)$-packing colorable and $(1,2,2,2,2)$-packing colorable. We also prove that every $(3,0)$-saturated subcubic graph is $(1,2,2,2,2,2)$-packing colorable.

math.CO↗

arXiv2024

$S$-Packing Coloring of Cubic Halin Graphs

Given a non-decreasing sequence $S = (s_{1}, s_{2}, \ldots , s_{k})$ of positive integers, an $S$-packing coloring of a graph $G$ is a partition of the vertex set of $G$ into $k$ subsets $\{V_{1}, V_{2}, \ldots , V_{k}\}$ such that for each $1 \leq i \leq k$, the distance between any two distinct vertices $u$ and $v$ in $V_{i}$ is at least $s_{i} + 1$. In this paper, we study the problem of $S$-packing coloring of cubic Halin graphs, and we prove that every cubic Halin graph is $(1,1,2,3)$-packing colorable. In addition, we prove that such graphs are $(1,2,2,2,2,2)$-packing colorable.

math.CO↗

arXiv2023

Hypergraphs with Polynomial Representation: Introducing $r$-splits

Inspired by the split decomposition of graphs and rank-width, we introduce the notion of $r$-splits. We focus on the family of $r$-splits of a graph of order $n$, and we prove that it forms a hypergraph with several properties. We prove that such hypergraphs can be represented using only $\mathcal O(n^{r+1})$ of its hyperedges, despite its potentially exponential number of hyperedges. We also prove that there exist hypergraphs that need at least $Ω(n^r)$ hyperedges to be represented, using a generalization of set orthogonality.

cs.DM↗

arXiv2023

New reducible configurations for graph multicoloring with application to the experimental resolution of McDiarmid-Reed's Conjecture (extended version)

A $(a,b)$-coloring of a graph $G$ associates to each vertex a $b$-subset of a set of $a$ colors in such a way that the color-sets of adjacent vertices are disjoint. We define general reduction tools for $(a,b)$-coloring of graphs for $2\le a/b\le 3$. In particular, using necessary and sufficient conditions for the existence of a $(a,b)$-coloring of a path with prescribed color-sets on its end-vertices, more complex $(a,b)$-colorability reductions are presented. The utility of these tools is exemplified on finite triangle-free induced subgraphs of the triangular lattice for which McDiarmid-Reed's conjecture asserts that they are all $(9,4)$-colorable. Computations on millions of such graphs generated randomly show that our tools allow to find a $(9,4)$-coloring for each of them except for one specific regular shape of graphs (that can be $(9,4)$-colored by an easy ad-hoc process). We thus obtain computational evidence towards the conjecture of McDiarmid\&Reed.

math.CO↗

arXiv2022

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

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$ with $|L(v)|= a$ for any vertex $v$ and $|L(u)\cap L(v)|\le c$ for any edge $uv$ of $G$, there exists an assignment $φ$ of sets of integers to the vertices of $G$ such that $φ(u)\subset L(u)$ and $|φ(v)|=b$ for any vertex $u$ and $φ(u)\cap φ(v)=\emptyset$ for any edge $uv$. Such a value of $c$ is called the separation number of $(G,a,b)$. Using a special partition of a set of lists for which we obtain an improved version of Poincaré's crible, we determine the separation number of the complete graph $K_n$ for some values of $a,b$ and $n$, and prove bounds for the remaining values.

math.CO↗

arXiv2020

Leader Election And Local Identifiers For 3D Programmable Matter

In this paper, we present two deterministic leader election algorithms for programmable matter on the face-centered cubic grid. The face-centered cubic grid is a 3-dimensional 12-regular infinite grid that represents an optimal way to pack spheres (i.e., spherical particles or modules in the context of the programmable matter) in the 3-dimensional space. While the first leader election algorithm requires a strong hypothesis about the initial configuration of the particles and no hypothesis on the system configurations that the particles are forming, the second one requires fewer hypothesis about the initial configuration of the particles but does not work for all possible particles' arrangement. We also describe a way to compute and assign-local identifiers to the particles in this grid with a memory space not dependent on the number of particles. A-local identifier is a variable assigned to each particle in such a way that particles at distance at most each have a different identifier.

cs.DM↗

arXiv2020

Choosability with Separation of Cycles and Outerplanar Graphs

We consider the following list coloring with separation problem of graphs: Given a graph $G$ and integers $a,b$, find the largest integer $c$ such that for any list assignment $L$ of $G$ with $|L(v)|\le a$ for any vertex $v$ and $|L(u)\cap L(v)|\le c$ for any edge $uv$ of $G$, there exists an assignment $φ$ of sets of integers to the vertices of $G$ such that $φ(u)\subset L(u)$ and $|φ(v)|=b$ for any vertex $v$ and $φ(u)\cap φ(v)=\emptyset$ for any edge $uv$. Such a value of $c$ is called the separation number of $(G,a,b)$. We also study the variant called the free-separation number which is defined analogously but assuming that one arbitrary vertex is precolored. We determine the separation number and free-separation number of the cycle and derive from them the free-separation number of a cactus. We also present a lower bound for the separation and free-separation numbers of outerplanar graphs of girth $g\ge 5$.

math.CO↗

arXiv2020

Packing colorings of subcubic outerplanar graphs

Given a graph $G$ and a nondecreasing sequence $S=(s_1,\ldots,s_k)$ of positive integers, the mapping $c:V(G)\longrightarrow \{1,\ldots,k\}$ is called an $S$-packing coloring of $G$ if for any two distinct vertices $x$ and $y$ in $c^{-1}(i)$, the distance between $x$ and $y$ is greater than $s_i$. The smallest integer $k$ such that there exists a $(1,2,\ldots,k)$-packing coloring of a graph $G$ is called the packing chromatic number of $G$, denoted $χ_ρ(G)$. The question of boundedness of the packing chromatic number in the class of subcubic (planar) graphs was investigated in several earlier papers; recently it was established that the invariant is unbounded in the class of all subcubic graphs. In this paper, we prove that the packing chromatic number of any 2-connected bipartite subcubic outerplanar graph is bounded by $7$. Furthermore, we prove that every subcubic triangle-free outerplanar graph has a $(1,2,2,2)$-packing coloring, and that there exists a subcubic outerplanar graph with a triangle that does not admit a $(1,2,2,2)$-packing coloring. In addition, there exists a subcubic triangle-free outerplanar graph that does not admit a $(1,2,2,3)$-packing coloring. A similar dichotomy is shown for bipartite outerplanar graphs: every such graph admits an $S$-packing coloring for $S=(1,3,\ldots,3)$, where $3$ appears $Δ$ times ($Δ$ being the maximum degree of vertices), and this property does not hold if one of the integers $3$ is replaced by $4$ in the sequence $S$.

math.CO↗

arXiv2018

Exact distance graphs of product graphs

Given a graph $G$, the exact distance-$p$ graph $G^{[\natural p]}$ has $V(G)$ as its vertex set, and two vertices are adjacent whenever the distance between them in $G$ equals $p$. We present formulas describing the structure of exact distance-$p$ graphs of the Cartesian, the strong, and the lexicographic product. We prove such formulas for the exact distance-$2$ graphs of direct products of graphs. We also consider infinite grids and some other product structures. We characterize the products of graphs of which exact distance graphs are connected. The exact distance-$p$ graphs of hypercubes $Q_n$ are also studied. As these graphs contain generalized Johnson graphs as induced subgraphs, we use some known and find some new constructions of their colorings. These constructions are applied for colorings of the exact distance-$p$ graphs of hypercubes with the focus on the chromatic number of $Q_{n}^{[\natural p]}$ for $p\in \{n-2,n-3,n-4\}$.

math.CO↗

arXiv2018

On packing chromatic number of subcubic outerplanar graphs

Although it has recently been proved that the packing chromatic number is unbounded on the class of subcubic graphs, there exists subclasses in which the packing chromatic number is finite (and small). These subclasses include subcubic trees, base-3 Sierpi{ń}ski graphs and hexagonal lattices.In this paper we are interested in the packing chromatic number of subcubic outerplanar graphs. We provide asymptotic bounds depending on structural properties of the outerplanar graphs and determine sharper bounds for some classes of subcubic outerplanar graphs.

cs.DM↗

arXiv2018

Distributed leader election and computation of local identifiers for programmable matter

The context of this paper is programmable matter, which consists of a set of computational elements, called particles, in an infinite graph. The considered infinite graphs are the square, triangular and king grids. Each particle occupies one vertex, can communicate with the adjacent particles, has the same clockwise direction and knows the local positions of neighborhood particles. Under these assumptions, we describe a new leader election algorithm affecting a variable to the particles, called the k-local identifier, in such a way that particles at close distance have each a different k-local identifier. For all the presented algorithms, the particles only need a O(1)-memory space.

cs.DC↗