In 1998 Teresa Haynes, Stephen Hedetniemi, and Peter Slater [85, 86] wrote the two so-
called “domination books” and in so doing provided the first comprehensive treatment of …

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

Bipartite graphs are perhaps the most basic of objects in graph theory, both from a
theoretical and practical point of view. However, sometimes they have been considered only …

Graph theory was founded by Euler [78] in 1736 as a generalization to the solution of the
famous problem of the Könisberg bridges. From 1736 to 1936, the same concept as graph …

Given a graph in any of the following graph classes: trapezoid graphs, circular permutation
graphs, convex graphs, Dilworth k graphs, k-polygon graphs, circular arc graphs and …

Any graph problem, which is NP-hard in general graphs, becomes polynomial-time solvable
when restricted to graphs in special classes. When does a difficult problem become easy …

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 …

For a graph G=(V, E), a set D⊆ V is called a semitotal dominating set of G if D is a
dominating set of G, and every vertex in D is within distance 2 of another vertex of D. The …

Constraint programming (CP) is mainly based on filtering algorithms; their association with
global constraints is one of the main strengths of CP because they exploit the specific …

An orthogonal ray graph is an intersection graph of horizontal and vertical rays (half-lines) in
the xy-plane. An orthogonal ray graph is a 2-directional orthogonal ray graph if all the …