3 citations · 4 across the 13 of their papers we have counts for
Showing 2007 · cs.DMShow all
3 papers · 2 filters
cs.DM2007
Another Proof of Wright's Inequalities
Vlady Ravelomanana
We present a short way of proving the inequalities obtained by Wright in [Journal of Graph Theory, 4: 393 - 407 (1980)] concerning the number of connected graphs with edges…
cs.DM2007
On the growth of components with non fixed excesses
Anne-Elisabeth Baert, Vlady Ravelomanana, Loÿs Thimonier
Denote by an -component a connected graph with edges more than vertices. We prove that the expected number of creations of -component, by means of adding a new edge t…
cs.DM2007
Minimum Sum Edge Colorings of Multicycles
Jean Cardinal, Vlady Ravelomanana, Mario Valencia-Pabon
In the minimum sum edge coloring problem, we aim to assign natural numbers to edges of a graph, so that adjacent edges receive different numbers, and the sum of the numbers assigne…