Search results
François Pirot. About me. Since September 1st 2021, I am an associate professor (maître de conférences) in Université Paris-Saclay. I am doing my research at the LISN in the team GALaC, and I am teaching at the Faculté des Sciences d'Orsay. Before that, I have held three postdoctoral positions.
françois Pirot. We investigate the effect of a fixed forbidden clique minor upon the strong chromatic index, both in multigraphs and in simple graphs. We conjecture for each $k\ge 4$ that any...
Strong chromatic index and Hadwiger number. Wouter Cames van Batenburg, Rémi de Joannis de Verclos, Ross J. Kang, François Pirot. Comments: 23 pages, 4 figures; v2 includes minor corrections, to appear in Journal of Graph Theory.
Journal of Graph Theory. Volume 97 Number 4 July 2021. (Theta, triangle)‐free and (even hole, K 4)‐free graphs—Part 1: Layered wheels Ni Luh Dewi Sintiari and Nicolas Trotignon. Published online 11 March 2021. Connected search for a lazy robber. Isolde Adler, Christophe Paul, and Dimitrios M. Thilikos. Published online 28 March 2021.
François Pirot. Université Grenoble Alpes, France. Alexander Scott. University of Oxford, UK. Download PDF. A subscription is required to access this article. Abstract. The asymptotic dimension is an invariant of metric spaces introduced by Gromov in the context of geometric group theory.
Colouring Sparse Graphs. François Pirot. Under the supervision of. Miguel. Couceiro. , Eric Cator, Ross Kang, and Jean-Sébastien Sereni. 04/11/2019. What is a graph?
Jun 2, 2023 · New bounds for odd colourings of graphs. Tianjiao Dai, Qiancheng Ouyang, François Pirot. Given a graph G, a vertex-colouring \sigma of G, and a subset X\subseteq V (G), a colour x \in \sigma (X) is said to be \emph {odd} for X in \sigma if it has an odd number of occurrences in X.
