An arborescence, which is a directed analogue of a spanning tree in an
u...
We prove that the computation of a combinatorial shortest path between t...
In 1973, Fisk proved that any 4-coloring of a 3-colorable triangulation
...
In this paper, we consider a transformation of k disjoint paths in a gra...
We initiate the study of k-edge-connected orientations of undirected gra...