Yannakakis and Gavril showed in [10] that the problem of finding a maximal matching of
minimum size (MMM for short), also called Minimum Edge Dominating Set, is NP-hard in …

In this paper we present the Selective Graph Coloring Problem, a generalization of the
standard graph coloring problem as well as several of its possible applications. Given a graph …

In this paper, we give a new characterization of equimatchable graphs that are graphs with
all maximal matchings having the same size. This gives an O ( n 2 m ) -algorithm for deciding …

Polar graphs are a common generalization of bipartite, cobipartite, and split graphs. They
are defined by the existence of a certain partition of vertices, which is NP-complete to decide …

A graph theoretical model is presented for constructing calendars for sports leagues where
balancing requirement have to be considered with respect to the different venues where …

We show that the geodetic number of proper interval graphs can be computed in polynomial
time. This problem is $\mbox{\rm NP}$ -hard on chordal graphs and on bipartite weakly …

We consider the problem of partitioning the node set of a graph into p cliques and k stable
sets, namely the (p,k)-coloring problem. Results have been obtained for general graphs […

Given a graph G and an integer k, a set S of vertices in G is k-sparse if S induces a graph with
a maximum degree of at most k. Many parameters in graph theory are defined in terms of …

Polar graphs are a natural extension of some classes of graphs like bipartite graphs, split
graphs and complements of bipartite graphs. A graph is (s,k)-polar if there exists a partition A,B …

We study the problem where a robot has to pick up items of different sizes which are stored
along a corridor. A natural requirement is that the items have to be collected in decreasing …