In this paper we consider clustering problems in which each point is endowed with a color.
The goal is to cluster the points to minimize the classical clustering cost but with the …

This book chronicles the development of graph factors and factorizations. It pursues a
comprehensive approach, addressing most of the important results from hundreds of …

What conditions ensure that a graph G contains some given spanning subgraph H? The
most famous examples of results of this kind are probably Dirac's theorem on Hamilton …

In the most general sense, a factor of a graph G is just a spanning subgraph of G and a
graph factorization of G is a partition of the edges of G into factors. However, as we shall see …

Let H be any graph. We determine up to an additive constant the minimum degree of a
graph G which ensures that G has a perfect H-packing (also called an H-factor). More …

A matching of the nodes of a graph is a set of edges not two of which are adjacent. Some
classical results about maximum cardinality matchings include the theorems of Gallai and …

Abstract Graph Factors and Matching Extensions deals with two important branches of graph
theory-factor theory and extendable graphs. Due to the mature techniques and wide ranges …

In a graph G a matching is a set of edges in which no two edges have a common endpoint.
An induced matching is a matching in which no two edges are linked by an edge of G. The …

We introduce SensorDCSP, a naturally distributed benchmark based on a real-world
application that arises in the context of networked distributed systems. In order to study the …

A subset of vertices in a graph is called a dissociation set if it induces a subgraph with a
vertex degree of at most 1. The maximum dissociation set problem, ie, the problem of finding …