Showing cs.DMShow 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.DM2016
2-Distance Colorings of Integer Distance Graphs
Brahim Benmedjdoub, Eric Sopena, Isma Bouchemakh
A 2-distance k-coloring of a graph G is a mapping from V (G) to the set of colors {1,. .. , k} such that every two vertices at distance at most 2 receive distinct colors. The 2-dis…