Let P_3 P 3 denote the path on three vertices. A P_3 P 3-packing of a given graph G is a
collection of vertex-disjoint subgraphs of G in which each subgraph is isomorphic to P_3 P 3 …

Graph decomposition is a partition of graph into its subgraphs. Star decomposition is the
decomposition of the graph into stars. In this paper we define a parameter, the star number …

In many wireless networks, there is no fixed physical backbone nor centralized network
management. The nodes of such a network have to self-organize in order to maintain a …

The book Graph Theory and Decomposition covers major areas of the decomposition of
graphs. It is a three-part reference book with nine chapters that is aimed at enthusiasts as …

We present a silent self-stabilizing distributed algorithm computing a maximal-star
decomposition of the underlying communication network. Under the unfair distributed …

A protocol is said to be self-stabilizing when the distributed system executing it is
guaranteed to recover from any fault that does not cause permanent damage. Designing …

The concept of self-stabilization was first introduced by Dijkstra in 1973. A distributed system
is self-stabilizing if it can start from any possible configuration and converges to a desired …

We present a silent self-stabilizing distributed algorithm computing a maximal p-star
decomposition of the underlying communication network. Under the unfair distributed …

Résumé Une p-étoile est un arbre de hauteur 1 avec exactement p feuilles. Une
décomposition maximale d'un graphe en p-étoiles disjointes est une partition des noeuds du …