#### Filter Results:

- Full text PDF available (2)

#### Publication Year

2016

2017

- This year (1)
- Last 5 years (3)
- Last 10 years (3)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Abdelhakim AitZai, Brahim Benmedjdoub, Mourad Boudhar
- J. Intelligent Manufacturing
- 2016

- Brahim Benmedjdoub, Éric Sopena, Isma Bouchemakh
- ArXiv
- 2016

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-distance chromatic number χ 2 (G) of G is then the mallest k for which G admits a 2-distance k-coloring. For any finite set of positive integers D = {d 1 ,. .. , d k }, the integer… (More)

- Brahim Benmedjdoub, Isma Bouchemakh, Éric Sopena
- ArXiv
- 2017

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 (ii) e = f , or (iii) vw = e or f. An incidence p-colouring of G is a mapping from the set of incidences of G to the set of colours {1,. .. , p} such that every two adjacent… (More)

- ‹
- 1
- ›