3 papers
math.CO2026
Degree sum conditions for a graph to have bounded conflict-free connection number
Dinh Hanh Dang, Trung Duy Doan, Pham Hoang Ha +1
A path in an edge-coloured graph is called \emph{conflict-free} if a colour is exclusively applied to one of its edges. A graph is considered \emph{conflict-free connected} if…
math.CO2026
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…
math.CO2025
Spanning trees of claw-free graphs with few leaves and branch vertices
Pham Hoang Ha, Nguyen Gia Hien
Let be a tree. A vertex of degree one is a \emph{leaf} of and a vertex of degree at least three is a \emph{branch vertex} of . A graph is said to be claw-free if it does…