The number of cut-edges and conflict-free connection number in planar graphs

Pham Hoang Ha, Dang Dinh Hanh, Vu Quang Minh

A \textit{cut-edge} of a connected graph is an edge whose deletion increases the number of components. In this paper, we first state some conditions for a planar graph to have a fe…