4 citations · 11 across the 8 of their papers we have counts for
12 papers
On star--PCGs: Exploring class boundaries for small values
Angelo Monti, Blerina Sinaimeri
A graph is a star--PCG if there exists a weight function and mutually exclusive intervals , such that there is an edge…
All Graphs with at most 8 nodes are 2-interval-PCGs
Tiziana Calamoneri, Angelo Monti, Fabrizio Petroni
A graph G is a multi-interval PCG if there exist an edge weighted tree T with non-negative real values and disjoint intervals of the non-negative real half-line such that each node…
On the domination number of -constrained de Bruijn graphs
Tiziana Calamoneri, Angelo Monti, Blerina Sinaimeri
Motivated by the work on the domination number of directed de Bruijn graphs and some of its generalizations, in this paper we introduce a natural generalization of de Bruijn graphs…
On Generalizations of Pairwise Compatibility Graphs
Tiziana Calamoneri, Manuel Lafond, Angelo Monti +1
A graph is a pairwise compatibility graph (PCG) if there exists an edge-weighted tree and an interval , such that each leaf of the tree is a vertex of the graph, and there i…
String factorisations with maximum or minimum dimension
Angelo Monti, Blerina Sinaimeri
In this paper we consider two problems concerning string factorisation. Specifically given a string and an integer find a factorisation of where each factor has length…
Some classes of graphs that are not PCGs
Pierluigi Baiocchi, Tiziana Calamoneri, Angelo Monti +1
A graph is a pairwise compatibility graph (PCG) if there exists an edge-weighted tree and two non-negative real numbers and , $d_{min} \leq d_{max}…