This book is written based on my class notes developed while teaching the undergraduate
graph theory course “Basic Graph Theory” at the Department of Computer Science and …

A graph G=(V,E) is a pairwise compatibility graph (PCG) if there exists an edge-weighted
tree T and two nonnegative real numbers d_min and d_max such that each leaf u of T is a …

Let T be an edge weighted tree and dmin, dmax be two non-negative real numbers where d
min≤ d max. The pairwise compatibility graph (PCG) of T for dmin, dmax is a graph G such …

A graph G=(V, E) is called a pairwise compatibility graph (PCG) if there exists an edge-
weighted tree T and two non-negative real numbers d min and d max such that each leaf lu …

A graph G is called a pairwise compatibility graph (PCG, for short) if it admits a tuple (T, w,
d_\min, d_\max)(T, w, d min, d max) of a tree T whose leaf set is equal to the vertex set of G …

Rare events have played an increasing role in molecular phylogenetics as potentially
homoplasy-poor characters. In this contribution we analyze the phylogenetic information …

A graph G=(V, E) is called a pairwise compatibility graph (PCG) if there exists an edge-
weighted tree T and two non-negative real numbers d min and d max such that each leaf lu …

Let T be an edge weighted tree and let d_ min, d_ max be two non-negative real numbers
where d_ min ≤ d_ max. A pairwise compatibility graph (PCG) of T for d_ min, d_ max is a …

In this paper we give a necessary condition and a sufficient condition for a graph to be a
pairwise compatibility graph (PCG). Let G be a graph and let G^ c G c be the complement of …

Abstract Azam et al.(2018) proposed a method to enumerate all pairwise compatibility
graphs (PCGs) with a given number n of vertices. For a tuple (G, T, σ, λ) of a graph G with n …