" 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 …

The maximum clique problem is a classical problem in combinatorial optimization which
finds important applications in different domains. In this paper we try to give a survey of …

In this paper we present a survey of results concerning algorithms, complexity, and
applications of the maximum clique problem. We discuss enumerative and exact algorithms …

Claw-free graphs — A survey - ScienceDirect Skip to main contentSkip to article Elsevier logo
Journals & Books Search RegisterSign in View PDF Download full issue Search ScienceDirect …

The class of fork-free graphs is an extension of claw-free graphs and their subclass of line
graphs. The first polynomial-time solution to the maximum weight independent set problem …

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 fork is a graph that is obtained from K1, 3 by subdividing one edge. It is known that for K1,
3-free graphs the problem of finding the largest independent set can be solved in a …

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 …

We provide two polynomial-time exact algorithms to compute a maximum stable set in
graphs that are respectively (P6, triangle)-free, and (P6, C4)-free. The algorithm devised for …