233 citations
- Université d'OrléansFR47 papers
- Services déconcentrés d'appui à la recherche Val de LoireFR39 papers
- Centre National de la Recherche ScientifiqueFR29 papers
- Université de ToursFR16 papers
- Laboratoire d'Informatique Fondamentale d'Orléans13 papers
- GREMAN, Matériaux, Microélectronique, Acoustique, NanotechnologiesFR11 papers
- Institut Polytechnique de BordeauxFR9 papers
- Laboratoire Bordelais de Recherche en InformatiqueFR9 papers
- Université de BordeauxFR9 papers
- Laboratoire d'Informatique, de Modélisation et d'Optimisation des SystèmesFR8 papers
- Czech Academy of SciencesCZ7 papers
- Czech Academy of Sciences, Institute of Computer ScienceCZ7 papers
6 papers · 1 filter
Neighbourhood complexity of graphs of bounded twin-width
Édouard Bonnet, Florent Foucaud, Tuomo Lehtilä +1
We give essentially tight bounds for, , the maximum number of distinct neighbourhoods on a set of vertices in a graph with twin-width at most~. Using the celebra…
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 of vertices of a graph such that each vertex of has a neighbour in , and for any two vertices of , th…
Domination and location in twin-free digraphs
Florent Foucaud, Shahrzad Heydarshahi, Aline Parreau
A dominating set in a digraph is a set of vertices such that every vertex is either in or has an in-neighbour in . A dominating set of a digraph is locating-dominati…
Strengthening the Murty-Simon conjecture on diameter 2 critical graphs
Antoine Dailly, Florent Foucaud, Adriana Hansberg
A graph is diameter-2-critical if its diameter is 2 but the removal of any edge increases the diameter. A well-studied conjecture, known as the Murty-Simon conjecture, states that…
On the heapability of finite partial orders
János Balogh, Cosmin Bonchiş, Diana Diniş +2
We investigate the partitioning of partial orders into a minimal number of heapable subsets. We prove a characterization result reminiscent of the proof of Dilworth's theorem, whic…
Smallest -critical graphs of odd-girth
Laurent Beaudou, Florent Foucaud, Reza Naserasr
Given a graph , a graph is called -critical if does not admit a homomorphism to , but any proper subgraph of does. Observe that -critical graphs are t…