3 papers
cs.DM2026
Pairwise Compatibility Graphs of Unweighted Caterpillars
Cyriac Antony, Manuel Lafond, Angelo Monti +1
In this paper we study pairwise compatibility graphs whose witness tree is required to be an unweighted caterpillar. This is a natural restriction of PCGs, in the same line of rese…
cs.DM2024
Effects of graph operations on star pairwise compatibility graphs
Angelo Monti, Blerina Sinaimeri
A graph is defined as a star--PCG when it is possible to assign a positive real number weight to each vertex , and define distinct intervals $I_1, I_2, \ldo…
cs.CC2024
Disjoint covering of bipartite graphs with -clubs
Angelo Monti, Blerina Sinaimeri
For a positive integer , an -club in a graph is a set of vertices inducing a subgraph with diameter at most . As generalizations of cliques, -clubs offer a flexible…