Modular decomposition is a technique that applies to (but is not restricted to) graphs. The
notion of a module naturally appears in the proofs of many graph theoretical theorems …

Every branch of mathematics employs some notion of a product that enables the com-
bination or decomposition of its elemental structures. In graph theory there are four main …

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 …

A module of an undirected graph is a set X of nodes such for each node x not in X, either
every member of X is adjacent to x, or no member of X is adjacent to x. There is a canonical …

For many problems in scheduling and timetabling, the choice of a mathematical
programming formulation is determined by the formulation of the graph colouring …

In this paper we deal with the substitution decomposition as known for Boolean functions,
set systems and relations. It is shown how combinatorial optimization problems, particularly …

A composition for directed graphs which generalizes the substitution (or X-join) composition
of graphs and digraphs, as well as the graph version of set-family composition, is described …

ABSTRACT Rolf H. Mohring* Technical University of Berlin Department of Mathematics
StraBe des 17. Juni 135 1000 Berlin 12 Ordered sets have recently gained much importance …

We present here a new algorithm linear in time and space complexity for Modular
Decomposition. This algorithm relies on structural properties of prime graphs (see theorems …

Comparability graphs are undirected graphs that represent the comparability relation of
partial orders. They constitute an important interface between graphs and partial orders both …