TBThomas Bellitto
Thomas Bellitto
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Thomas Bellitto has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Arnaud Pêcher
LaBRI, Université de Bordeaux, Talence, France
1 shared publication - Christine Bachoc
Institut de Mathématiques de Bordeaux
1 shared publication - Jørgen Bang-Jensen
Department of Mathematics and Computer Science University of Southern Denmark Odense Denmark
1 shared publication - Marcin Witkowski
Adam Mickiewicz University
1 shared publication - Martin Merker
Technical University of Denmark
1 shared publication - Michael Stiebitz
Technische Universität Ilmenau Ilmenau Germany
1 shared publication
Latest Publications
- 24 July 2021
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 37 (6) , 2595-2599
Counterexamples to Thomassen’s Conjecture on Decomposition of Cubic Graphs
- 24 July 2021
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 37 (6) , 2595-2599
Counterexamples to Thomassen’s Conjecture on Decomposition of Cubic Graphs
- Open Access
- 8 August 2019
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 62 (3) , 497-524
On the Density of Sets Avoiding Parallelohedron Distance 1
- 8 August 2019
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 62 (3) , 497-524
Open AccessOn the Density of Sets Avoiding Parallelohedron Distance 1
- Open Access
On DP-Coloring of Digraphs
DP-coloring is a relatively new coloring concept by Dvo\v{r}\'ak and Postle and was introduced as an extension of list-colorings of (undirected) graphs. It transforms the problem of finding a list-coloring of a given graph $G$ with a list-assignment $L$ to finding an independent transversal in an auxiliary graph with vertex set $\{(v,c) ~|~ v \in V(G), c \in L(v)\}$. In this paper, we extend the definition of DP-colorings to digraphs using the approach from Neumann-Lara where a coloring of a digraph is a coloring of the vertices such that the digraph does not contain any monochromatic directed cycle. Furthermore, we prove a Brooks' type theorem regarding the DP-chromatic number, which extends various results on the (list-)chromatic number of digraphs.Open AccessOn DP-Coloring of Digraphs
DP-coloring is a relatively new coloring concept by Dvo\v{r}\'ak and Postle and was introduced as an extension of list-colorings of (undirected) graphs. It transforms the problem of finding a list-coloring of a given graph $G$ with a list-assignment $L$ to finding an independent transversal in an auxiliary graph with vertex set $\{(v,c) ~|~ v \in V(G), c \in L(v)\}$. In this paper, we extend the definition of DP-colorings to digraphs using the approach from Neumann-Lara where a coloring of a digraph is a coloring of the vertices such that the digraph does not contain any monochromatic directed cycle. Furthermore, we prove a Brooks' type theorem regarding the DP-chromatic number, which extends various results on the (list-)chromatic number of digraphs.