In 1996, Matheson and Tarjan proved that every near planar triangulation...
Recently, Letzter proved that any graph of order n contains a collection...
Let S_k(n) be the maximum number of orientations of an n-vertex graph G
...
A P_ℓ-decomposition of a graph G is a set of paths with ℓ edges
in G tha...
Alon and Yuster proved that the number of orientations of any n-vertex
g...
Tuza (1981) conjectured that the size τ(G) of a minimum set of edges
tha...
A path decomposition of a graph G is a collection of edge-disjoint paths...
A path decomposition of a graph G is a collection of edge-disjoint paths...