François Pirot

collaborators

2 papers

math.CO2025

Vertex-partitions of 2-edge-colored graphs

Jørgen Bang-Jensen, Francois Pirot, Anders Yeo

A {\bf $k$ -majority coloring} of a digraph $D = (V, A)$ is a coloring of $V$ with $k$ colors so that each vertex $v \in V$ has at least as many out-neighbours of color differe…

math.CO2025

New bounds for proper $h$ -conflict-free colourings

Quentin Chuet, Tianjiao Dai, Qiancheng Ouyang +1

A proper $k$ -colouring of a graph $G$ is called $h$ -conflict-free if every vertex $v$ has at least $min {h, deg (v)}$ colours appearing exactly once in its neighbourhood.…

Vertex-partitions of 2-edge-colored graphs

New bounds for proper h-conflict-free colourings

New bounds for proper $h$ -conflict-free colourings