22 citations · 22 across the 3 of their papers we have counts for
3 papers
math.CO2017
Edge arboricity : Do we need equitabilility ?
Nathan Lhote, Mohammed Senhaji
In this paper we study a new variant of graph arboricity, which requires all the forests to have the same number of edges (up to a difference of 1). We prove that the new variant,…
math.CO2017★ 22 cited
On a combination of the 1-2-3 Conjecture and the Antimagic Labelling Conjecture
Julien Bensmail, Mohammed Senhaji, Kasper Szabo Lyngsie
This paper is dedicated to studying the following question: Is it always possible to injectively assign the weights to the edges of any given graph (with no comp…
cs.DM2017
Equitable neighbour-sum-distinguishing edge and total colourings
Olivier Baudon, Monika Pilsniak, Jakub Przybylo +3
With any (not necessarily proper) edge -colouring of a graph ,one can associate a vertex colouring given by $σ\_γ(v)=\sum\_{e\ni v…