" Provides the first comprehensive treatment of theoretical, algorithmic, and application
aspects of domination in graphs-discussing fundamental results and major research …

When dealing with special graph classes and algorithmic problems on them, a main source
is the classical book of Golumbic, Algorithmic Graph Theory and Perfect Graphs [454]. The …

Abstract The Independent Set problem is NP-hard in general, however polynomial time
algorithms exist for the problem on various specific graph classes. Over the last couple of …

We present an algorithm that takes as input a graph G with weights on the vertices, and
computes a maximum weight independent set S of G. If the input graph G excludes a path P …

Numerous applications in scheduling, such as resource allocation or steel manufacturing,
can be modeled using the NP-hard Independent Set problem (given an undirected graph …

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 …

An induced matching in a graph G is a set of edges, no two of which meet a common node
or are joined by an edge of G; that is, an induced matching is a matching which forms an …

The definitions of four previously studied parameters related to total coverings and total
matchings of graphs can be restricted, thereby obtaining eight parameters related to …

The leafage l (G) of a chordal graph G is the minimum number of leaves of a tree in which G
has an intersection representation by subtrees. We obtain upper and lower bounds on l (G) …

Packing a maximum number of disjoint triangles into a given graph G is NP-hard, even for
most classes of structured graphs. In contrast, we show that packing a maximum number of …