
Counting orientations of graphs with no strongly connected tournaments
Let S_k(n) be the maximum number of orientations of an nvertex graph G ...
read it

Decomposition of (2k+1)regular graphs containing special spanning 2kregular Cayley graphs into paths of length 2k+1
A P_ℓdecomposition of a graph G is a set of paths with ℓ edges in G tha...
read it

Counting graph orientations with no directed triangles
Alon and Yuster proved that the number of orientations of any nvertex g...
read it

On Tuza's conjecture for triangulations and graphs with small treewidth
Tuza (1981) conjectured that the size τ(G) of a minimum set of edges tha...
read it

Towards Gallai's path decomposition conjecture
A path decomposition of a graph G is a collection of edgedisjoint paths...
read it

Gallai's path decomposition conjecture for trianglefree planar graphs
A path decomposition of a graph G is a collection of edgedisjoint paths...
read it
Fábio Botler
is this you? claim profile