The function f(n) is defined to be the smallest integer such that any f(n)-chromatic digraph contains all paths with two blocks P(k, j) with k + j = n âˆ’ 1. El Sahili conjectured that f(n) = n. Weâ€¦ (More)

2011 XXXth URSI General Assembly and Scientificâ€¦

2011

The design of future multi-standard systems is very challenging. Flexible architectures exploiting processing commonalities of the different set of standards cohabiting in the device offer promisingâ€¦ (More)

The design of future multi-standard systems is very challenging. Flexible architectures that exploit common aspects between the different set of standards cohabiting in the device offer promisingâ€¦ (More)

The underlying graphG(D) of a digraphD is arising when directions of edges are ignored. ChvÃ¡tal and Ebenegger prove that recognising underlying graphs of line digraphs is an NP-complete problem. Weâ€¦ (More)

A b-coloring of a graph is a proper coloring such that every color class contains a vertex adjacent to at least one vertex in each of the other color classes. The b-chromatic number of a graph G,â€¦ (More)

The b-chromatic number of a graph G, denoted by b(G), is the largest positive integer k such that there exists a proper coloring for G with k colors in which every color class contains at least oneâ€¦ (More)