The survey is a comprehensive overview of the developing area of parameterized
algorithms for graph modification problems. It describes state of the art in kernelization …

The theory of graphs is one of the few fields of mathematics with a definite birth date. It is the
subject of graph theory of course that we are about to describe. The statement above was …

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 …

Cuts and metrics are well-known objects that arise-independently, but with many deep and
fascinating connections-in diverse fields: in graph theory, combinatorial optimization …

The maximum common subgraph (MCS) problem has become increasingly important in
those aspects of chemoinformatics that involve the matching of 2D or 3D chemical …

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 …

Line graphs have the property that their least eigenvalue is greater than or equal to-2, a
property shared by generalized line graphs and a finite number of so-called exceptional …

There are at least three models of discrete-time quantum walks (QWs) on graphs currently
under active development. In this work, we focus on the equivalence of two of them, known …

We investigate for temporal graphs the computational complexity of separating two distinct
vertices s and z by vertex deletion. In a temporal graph, the vertex set is fixed but the edges …

In 1918, Heinz Prüfer [120] discovered a fascinating relationship between labelled trees with
n vertices and sequences of length n− 2 made of the elements of the set {1, 2,..., n}. This …