6 citations · 6 across the 12 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
math.CO2015
Spanning k-ended trees of 3-regular connected graphs
Hamed Ghasemian Zoeram, Daniel Yaqubi
A tree is called k-ended tree if it has at most k leaves, where a leaf is a vertex of degree one. In this paper we prove that every 3-regular connected graph with n vertices such t…
math.CO2015
The Twelvefold way, the non-intersecting circles problem, and partitions of multisets
Toufik Mansour, Madjid Mirzavaziri, Daniel Yaqubi
Let be a non-negative integer and be a multi-set with not necessarily distinct members, where . We denote by $Δ(n,A)…