University of Clermont Auvergne

output

20142026

Z

Topological Insulator

280 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

8 papers · 1 filter

math.CO2024

On full-separating sets and related codes in graphs

Dipayan Chakraborty, Annegret K. Wagler

A domination-based identification problem on a graph $G$ is one where the objective is to choose a subset $C$ of the vertex set of $G$ such that $C$ has both, a domination property…

math.CO2023

Algorithms and hardness for Metric Dimension on digraphs

Antoine Dailly, Florent Foucaud, Anni Hakanen

In the Metric Dimension problem, one asks for a minimum-size set $R$ of vertices such that for any pair of vertices of the graph, there is a vertex from $R$ whose two distances to…

math.CO2023★ 2 cited

Extremal digraphs for open neighbourhood location-domination and identifying codes

Florent Foucaud, Narges Ghareghani, Pouyeh Sharifani

A set $S$ of vertices of a digraph $D$ is called an open neighbourhood locating-dominating set if every vertex in $D$ has an in-neighbour in $S$ , and for every pair $u, v$ of vertic…

math.CO2023

On locating and neighbor-locating colorings of sparse graphs

Dipayan Chakraborty, Florent Foucaud, Soumen Nandi +2

A proper $k$ -coloring of a graph $G$ is a \emph{neighbor-locating $k$ -coloring} if for each pair of vertices in the same color class, the two sets of colors found in their respecti…

math.CO2022★ 3 cited

Bounds and extremal graphs for total dominating identifying codes

Florent Foucaud, Tuomo Lehtilä

An identifying code $C$ of a graph $G$ is a dominating set of $G$ such that any two distinct vertices of $G$ have distinct closed neighbourhoods within $C$ . The smallest size of an…

math.CO2021★ 3 cited

Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k

Mamadou Mostapha Kanté, Eun Jung Kim, O-joung Kwon +1

Every minor-closed class of matroids of bounded branch-width can be characterized by a list of excluded minors, but unlike graphs, this list may need to be infinite in general. How…

math.CO2021★ 10 cited

Characterizing extremal graphs for open neighbourhood location-domination

Florent Foucaud, Narges Ghareghani, Aida Roshany-Tabrizi +1

An open neighbourhood locating-dominating set is a set $S$ of vertices of a graph $G$ such that each vertex of $G$ has a neighbour in $S$ , and for any two vertices $u, v$ of $G$ , th…

math.CO2020

Tree pivot-minors and linear rank-width

Konrad K. Dabrowski, François Dross, Jisu Jeong +4

Tree-width and its linear variant path-width play a central role for the graph minor relation. In particular, Robertson and Seymour (1983) proved that for every tree~ $T$ , the class…