4 citations · 13 across the 16 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
math.CO2018
On DP-Coloring of Digraphs
Jørgen Bang-Jensen, Thomas Bellitto, Thomas Schweser +1
DP-coloring is a relatively new coloring concept by Dvořák and Postle and was introduced as an extension of list-colorings of (undirected) graphs. It transforms the problem of find…
math.MG2018★ 2 cited
On the density of sets of the Euclidean plane avoiding distance 1
Thomas Bellitto, Arnaud Pêcher, Antoine Sédillot
A subset is said to avoid distance if: In this paper we study the number which is…
cs.DS2018★ 1 cited
On Minimum Connecting Transition Sets in Graphs
Thomas Bellitto, Benjamin Bergougnoux
A forbidden transition graph is a graph defined together with a set of permitted transitions i.e. unordered pair of adjacent edges that one may use consecutively in a walk in the g…