11 citations · 32 across the 7 of their papers we have counts for
Showing 2012Show all
3 papers · 1 filter
math.CO2012★ 5 cited
Spanning trees with many leaves: lower bounds in terms of number of vertices of degree 1, 3 and at least~4
Dmitri Karpov
We prove that every connected graph with vertices of degree~1 and 3 and vertices of degree at least~4 has a spanning tree with at least ${1\over 3}t +{1\over 4}s+{3\over 2}…
math.CO2012
The structure of decomposition of a triconnected graph
Dmitri Karpov, Alexey Pastor
We describe the structure of triconnected graph with the help of its decomposition by 3-cutsets. We divide all 3-cutsets of a triconnected graph into rather small groups with a sim…
math.CO2012★ 3 cited
Spanning trees with many leaves: new lower bounds in terms of number of vertices of degree~3 and at least~4
D. V. Karpov
We prove, that every connected graph with vertices of degree 3 and vertices of degree at least~4 has a spanning tree with at least leaves, wher…