86 citations
- Institut National des Sciences Appliquées Centre Val de LoireFR39 papers
- Université d'OrléansFR26 papers
- Centre National de la Recherche ScientifiqueFR24 papers
- Université de ToursFR12 papers
- GREMAN, Matériaux, Microélectronique, Acoustique, NanotechnologiesFR9 papers
- Czech Academy of SciencesCZ7 papers
- Czech Academy of Sciences, Institute of Computer ScienceCZ7 papers
- Institut Polytechnique de BordeauxFR5 papers
- Laboratoire Bordelais de Recherche en InformatiqueFR5 papers
- Laboratoire d'Informatique, de Modélisation et d'Optimisation des SystèmesFR5 papers
- Université de BordeauxFR5 papers
- Université Paris-SaclayFR5 papers
4 papers · 1 filter
On graphs coverable by k shortest paths
Maël Dumas, Florent Foucaud, Anthony Perez +1
We show that if the edges or vertices of an undirected graph can be covered by shortest paths, then the pathwidth of is upper-bounded by a single-exponential function o…
Exact square coloring of subcubic planar graphs
Florent Foucaud, Hervé Hocquard, Suchismita Mishra +4
We study the exact square chromatic number of subcubic planar graphs. An exact square coloring of a graph G is a vertex-coloring in which any two vertices at distance exactly 2 rec…
Fixing improper colorings of graphs
Valentin Garnero, Konstanty Junosza-Szaniawski, Mathieu Liedloff +2
In this paper we consider a variation of a recoloring problem, called the Color-Fixing. Let us have some non-proper -coloring of a graph . We investigate the problem of f…
PSPACE-Completeness of Majority Automata Networks
Eric Goles, Pedro Montealegre, Ville Salo +1
We study the dynamics of majority automata networks when the vertices are updated according to a block sequential updating scheme. In particular, we show that the complexity of the…