Let $G$ be a (simple) gtoph with maximum degree three and
chromatic index four. A 3-edge-coloring of G is a coloring of
its edges in which only three colors are used. Then a vertex is
conflicting when some edges incident ...

The use of SIMD computers requires efficient schemes of storage of data in order to have conflict-free acces in parallel computation. In this paper we restate the problem of finding such chemes in an algebraic context. ...

Connectivity is one of the central concepts of graph theory, from both a theoret- ical and a practical point of view. Its theoretical implications are mainly based on the existence of nice max-min characterization results, ...

Continuing the study of connectivity, initiated in §4.1 of the Handbook, we survey here some (sufficient) conditions under which a graph or digraph has a given connectivity or edge-connectivity. First, we describe results ...

A dominating set
S
of a graph
G
is called
locating-dominating
,
LD-set
for
short, if every vertex
v
not in
S
is uniquely determined by the set of neighbors of
v
belonging to
S
. Locating-dominating sets ...

The polynomial method refers to the application of polynomials to combinatorial
problems. The method is particularly effective for Galois geometries and a number
of problems and conjectures have been solved using the ...