Éric Sopena

activity

20162023

Δ ⩾ 8

is totally

(Δ + 2)

-choosable

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

collaborators

3 papers

math.CO2023

A theoretical expansion of the Sprout game

Soura Sena Das, Zin Mar Myint, Soumen Nandi +2

Sprout is a two-player pen and paper game which starts with $n$ vertices, and the players take turns to join two pre-existing dots by a subdivided edge while keeping the graph sub-…

cs.DM2019★ 1 cited

Every planar graph with $Δ ⩾ 8$ is totally $(Δ + 2)$ -choosable

Marthe Bonamy, Théo Pierron, Éric Sopena

Total coloring is a variant of edge coloring where both vertices and edges are to be colored. A graph is totally $k$ -choosable if for any list assignment of $k$ colors to each vert…

cs.DM2016

A Study of $k$ -dipath Colourings of Oriented Graphs

Christopher Duffy, Gary MacGillivray, Éric Sopena

We examine $t$ -colourings of oriented graphs in which, for a fixed integer $k \geq 1$ , vertices joined by a directed path of length at most $k$ must be assigned different colours.…

A theoretical expansion of the Sprout game

Every planar graph with Δ⩾8 is totally (Δ+2)-choosable

A Study of k-dipath Colourings of Oriented Graphs

Every planar graph with $Δ ⩾ 8$ is totally $(Δ + 2)$ -choosable

A Study of $k$ -dipath Colourings of Oriented Graphs