2 papers
cs.DM2024
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…
math.CO2024
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…