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

The theory of directed graphs has developed enormously over recent decades, yet this book
(first published in 2000) remains the only book to cover more than a small fraction of the …

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 kernel of a directed graph D is defined as an independent set which is reachable from
each outside vertex by an arc. A graph G is called kernel-solvable if an orientation D of G …

We discuss five fundamental results of discrete mathematics: the lemmas of Sperner and
Tucker from combinatorial topology and the theorems of Carathéodory, Helly, and Tverberg …

Roughly speaking, the family of combinatorial games consists of two-player games with
perfect information (no hidden information as in some card games), no chance moves (no …

Vector instruction sets are receiving renewed interest because of their applicability to
multimedia. Current multimedia instruction sets use short vectors with SIMD …

We consider generalizations of the Gale–Shapley (Amer. Math. Monthly 69 (1962) 9) Stable
Marriage Problem to three-sided families. Alkan (Math. Social Sci. 16 (1988) 207) gave an …

Persistent-postural perceptual dizziness (PPPD) is a recently-defined diagnosis of chronic
vestibular symptoms, which is exacerbated by exposure to moving objects and self-motion …

The clique number of a digraph D is the size of the largest bidirectionally complete
subdigraph of D. D is perfect if, for any induced subdigraph H of D, the dichromatic number …