4 citations · 13 across the 16 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.DS2020
The Complexity of Connectivity Problems in Forbidden-Transition Graphs and Edge-Colored Graphs
Thomas Bellitto, Shaohua Li, Karolina Okrasa +2
The notion of forbidden-transition graphs allows for a robust generalization of walks in graphs. In a forbidden-transition graph, every pair of edges incident to a common vertex is…
math.CO2020★ 1 cited
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…