20 citations · 65 across the 20 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DM2017
Incidence Choosability of Graphs
Brahim Benmedjdoub, Isma Bouchemakh, Eric Sopena +1
An incidence of a graph G is a pair (v, e) where v is a vertex of G and e is an edge of G incident with v. Two incidences (v, e) and (w, f) of G are adjacent whenever (i) v = w, or…
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…