Lucas Pastor

activity

20152021

most citedRevisiting a theorem by Folkman on graph colouring

1 citations · 1 across the 8 of their papers we have counts for

collaborators

Showing 2015Show all

3 papers · 1 filter

math.CO2015

4-coloring ( $P_{6}$ , bull)-free graphs

Frédéric Maffray, Lucas Pastor

We present a polynomial-time algorithm that determines whether a graph that contains no induced path on six vertices and no bull (the graph with vertices a, b, c, d, e and edges ab…

math.CO2015

Disproving the normal graph conjecture

Ararat Harutyunyan, Lucas Pastor, Stéphan Thomassé

A graph $G$ is called normal if there exist two coverings, $C$ and $S$ of its vertex set such that every member of $C$ induces a clique in $G$ , every mem…

math.CO2015

On the choosability of claw-free perfect graphs

Sylvain Gravier, Frédéric Maffray, Lucas Pastor

It has been conjectured that for every claw-free graph $G$ the choice number of $G$ is equal to its chromatic number. We focus on the special case of this conjecture where $G$ is p…

4-coloring (P6​, bull)-free graphs

Disproving the normal graph conjecture

On the choosability of claw-free perfect graphs

4-coloring ( $P_{6}$ , bull)-free graphs