11 citations · 32 across the 21 of their papers we have counts for
Showing 2019 · cs.DMShow all
3 papers · 2 filters
cs.DM2019★ 1 cited
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…
cs.DM2019
Spanning eulerian subdigraphs in semicomplete digraphs
Jørgen Bang-Jensen, Frédéric Havet, Anders Yeeo
A digraph is eulerian if it is connected and every vertex has its in-degree equal to its out-degree. Having a spanning eulerian subdigraph is thus a weakening of having a hamiltoni…
cs.DM2019
Arc-disjoint Strong Spanning Subdigraphs of Semicomplete Compositions
Joergen Bang-Jensen, Gregory Gutin, Anders Yeo
A strong arc decomposition of a digraph is a decomposition of its arc set into two disjoint subsets and such that both of the spanning subdigraphs $D_1=(V…