4 citations · 13 across the 16 of their papers we have counts for
4 papers · 1 filter
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…
The directed 2-linkage problem with length constraints
Jørgen Bang-Jensen, Thomas Bellitto, William Lochet +1
The {\sc weak 2-linkage} problem for digraphs asks for a given digraph and vertices whether contains a pair of arc-disjoint paths such that is…
Proper-walk connection number of graphs
Jørgen Bang-Jensen, Thomas Bellitto, Anders Yeo
This paper studies the problem of proper-walk connection number: given an undirected connected graph, our aim is to colour its edges with as few colours as possible so that there e…