Gallai's path decomposition conjecture for triangle-free planar graphs

Fábio Botler, Andrea Jiménez, Maycon Sambinelli

A path decomposition of a graph $G$ is a collection of edge-disjoint paths of $G$ that covers the edge set of $G$. Gallai (1968) conjectured that every connected graph on $n$ verti…