1 citations · 2 across the 6 of their papers we have counts for
5 papers · 1 filter
Supereulerian 2-edge-coloured graphs
Jørgen Bang-Jensen, Thomas Bellitto, Anders Yeo
A 2-edge-coloured graph is {\bf supereulerian} if contains a spanning closed trail in which the edges alternate in colours. An {\bf eulerian factor} of a 2-edge-coloured gr…
Counterexamples to Thomassen's conjecture on decomposition of cubic graphs
Thomas Bellitto, Tereza Klimošová, Martin Merker +2
We construct an infinite family of counterexamples to Thomassen's conjecture that the vertices of every 3-connected, cubic graph on at least 8 vertices can be colored blue and red…
Hajós and Ore constructions for digraphs
Jørgen Bang-Jensen, Thomas Bellitto, Michael Stiebitz +1
The chromatic number of a digraph is the minimum number of colors needed to color the vertices of such that each color class induces an acyclic subdig…
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…
On the density of sets avoiding parallelohedron distance 1
Christine Bachoc, Thomas Bellitto, Philippe Moustrou +1
The maximal density of a measurable subset of R^n avoiding Euclidean distance1 is unknown except in the trivial case of dimension 1. In this paper, we consider thecase of a distanc…