6 citations · 7 across the 3 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
math.CO2015
Disjoint cycles of different lengths in graphs and digraphs
Julien Bensmail, Ararat Harutyunyan, Ngoc Khang Le +2
Understanding how the cycles of a graph or digraph behave in general has always been an important point of graph theory. In this paper, we study the question of finding a set of $k…
math.CO2015★ 1 cited
On the existence of vertex-disjoint subgraphs with high degree sum
Shuya Chiba, Nicolas Lichiardopol
For a graph , we denote by the minimum degree sum of two non-adjacent vertices if is non-complete; otherwise, . In this paper, we prove the fo…